Saturated Chain Partitions in Ranked Partially Ordered

Sets, and Non-Monotone Symmetric 11-Venn Diagrams

Peter Hamburger

Gyorgy Petruska

and Attila Sali

Department of Mathematical Sciences

Department of Computer Science

Indiana University - Purdue University Fort Wayne
Fort Wayne, Indiana 46805

Alfred Renyi Institute of Mathematics

Budapest, P.O.Box 127 H-1364 Hungary

e-mail:

hamburge@ipfw.edu

sali@renyi.hu

petruskg@ipfw.edu
Abstract
In this paper we show that there are at least 2
110
non-isomorphic 11-doilies, that is,
there are many non-isomorphic symmetric, non-simple, non-monotone 11-Venn dia-
grams, with many vertices. We do not achieve the maximum vertex set size, 2046,
but we approach it closely, improving from the previous 462 in [10] to 1837. The doilies
constructed here cannot be constructed by either of the methods of [10] or [6]. The
main purpose of this paper is not to publish these attractive diagrams but to inspire
new studies by raising ideas, methods, questions, and conjectures, hoping for results
analogous to those generated in [10]. These ideas connect two seemingly distant areas
of mathematics: a special area of combinatorial geometry, namely, certain families of
simple closed Jordan curves in the plane, and the study of ranked partially ordered sets
or posets.
1 Introduction
In [10] the rst (nonsimple) symmetric Venn diagram with 11 curves, that is an 11-doily, was
recently published. This doily is special in many ways. It is monotone, (for the denitions
and the properties of ranked posets, as well as of the dierent type of doilies and Venn dia-
grams, see Sections 1.1 and 1.2,) and thus it is isomorphic to a 11-doily which can be drawn
with all convex curves, see [1]. Its vertex set has the size 462 =
_
11
111
2
_
=
111
, the number
1
of vertices in the middle layer of the 11-hypercube. This example is constructed by using a
symmetric chain partition of the 11-hypercube. In [10] and [11] also a method is suggested
to settle this problem with these special properties, for any prime p greater than 11. This
was recently followed through in [6], by Griggs, Killian, and Savage, showing that indeed,
there are nonsimple, monotone, symmetric p-Venn diagrams for every prime p greater than
11 with the vertex set of size
_
p
p1
2
_
=
p1
. This size of the vertex set is determined by the
fact that any symmetric chain partition of a ranked poset must have
p1
chains, (see [2]).
Their proof is a constructive proof.
For p = 11 the maximal vertex set size (the simple doily case) is 2
11
2 = 2046. The minimal
possible vertex set size, as allowed by Eulers planar graph theorem and the rotational sym-
metry, is 209. Though the cases with the vertex set size
p1
are settled, other cases, and
in particular the most interesting case, the maximal-sized vertex set, that is the existence of
simple doilies, is still unsolved for any prime number bigger than 7. The existence of simple
p-doilies with prime numbers greater than 7 is a open conjecture of Gr unbaum [8]. There
are also only a few known diagrams, with fewer than 462 vertices for p = 11, [12, 13].
Following the method suggested in [10, 11], Griggs at. el. in [6], with a delicate use of Greene
and Kleitmans so-called parenthesis matching approach, (see [5]), showed that if p is any
prime number, then there is always a way to select a complete set of cyclic representatives of
binary codes so that the induced subposet of the Boolean lattice (or the p-hypercube) has a
symmetric chain partition such that it forms a special planar subgraph, (called a doodle) of
the p-hypercube. The cyclic rotation of this graph generates a spanning, 2-connected planar
subgraph of the p-hypercube, (called a Venn model). In [11] it is shown that this kind of
graph is the dual graph of a non-simple symmetric Venn diagram.
In this paper we take another approach. Instead of using symmetric chain partitions of the
Boolean lattice we use saturated chain partitions. This leads us to have more faces in the
Venn model, and thus many more vertices in the Venn diagram. The maximum number
of vertices that we could reach with this method so far is 1837, which is 209 less than the
possible maximum 2046. But even in the minimal diagram we create in this paper there are
627 faces in the Venn model and thus 627 vertices in the Venn diagram. This means that in
addition to the 462 symmetric chains, there are 198 additional saturated chains in the chain
partition. Many of them are in the upper half, and many are in the lower half of the lattice.
This also means that these diagrams cannot be constructed with the method of [6], [10, 11],
or [12, 13]. The diagrams are created in this paper are all non-monotone with many vertices.
There are a few known non-monotone, symmetric 11-Venn diagrams. They are created by
another method using special path decomposition of the Boolean lattice, and they have only
few vertices, [12, 13].
We believe that these diagrams are interesting and denitely very attractive. Still the main
reason to publish this paper is not just showing those diagrams but rather presenting ideas,
methods, conjectures, and problems. They can inspire further studies of ranked posets which
may have important ramications not only in the study of Venn diagrams but in other areas
2
Ranked Posets
Boolean Lattice B
n
n-Hypercube Venn Diagram
n-Hypercube graph
Dual D(F)
Venn Graph
Venn Model
V(F)
Geometrical Graph
n-Doodle n-Doily
Figure 1: The logical relationship of Venn-related structures
as well. We also hope these methods can result in proving that there are p-doilies for all
prime numbers p with all possible sizes of vertex sets bigger than
p1
, and in particular, we
hope they will lead us to a proof of Gr unbaums conjecture on simple doilies.
The remainder of this paper is organized as follows. Section 1.1 describes the concepts of
ranked posets, Boolean lattices, p-hypercubes, and some of their properties we use here. The
concepts of chains, saturated chains, and symmetric chains are also dened. It also describes
the concept of symmetric or saturated chain partition of the Boolean lattice. Here also the
concepts of chain cover property, chain cover map, chain cover graph, chain cover tree, cyclic
binary code classes, poset of the cyclic binary code classes, the generator of the poset of the
cyclic binary code classes, and the (symmetric or saturated) chain cover generator graph are
recapitulated or introduced. Among them there are the new concepts such as the monotone
and non-monotone chain cover property, (but we simply call the second one the chain cover
property,) extended chain cover graph, and the concept of conict graph. Using these concepts
in Theorem 9, a necessary and sucient condition for a saturated chain decomposition of
the Boolean lattice with a planar embedding is given. This theorem generalizes the result of
the main idea of [6], that is, Theorem 9 is the generalization of the result of Lemma 1 of [6].
Section 1.2 describes the concept of Venn diagrams, it denes the dierent types of Venn
diagrams. Here we also show the connections between the dierent type of Venn diagrams
and the concepts listed in Section 1.1. The concept of symmetric Venn diagrams, that is,
the concept of doilies is introduced in Section 1.3. This section also briey repeats some of
the ideas and methods of [10] and [11] that are needed to understand the construction of
doilies, and contains the key technical results about doilies. Also the connections between
the concepts listed in Section 1.1 and the concept of doily are studied. Sections 2 and 3
contain the details of our construction of the many non-isomorphic, non-monotone 11-doilies
with dierent sizes of vertex sets, varying between 627 and 1837. Finally, Section 4 suggests
some ideas, methods, conjectures, and open problems.
3
1.1 Ranked Posets and Chains
Denition 1. Let T = (P, ) be a poset. y P is said to cover x P if x < y and there is
no z such that x < z < y. The poset T is ranked if there is an integer valued function r(x)
on P such that r(x) = 0 for all minimal elements x of P and r(y) = r(x) + 1 for all x, y if
y covers x. If T is ranked, then r(x) is called the rank of x, and the rank of T is max
x
r(x).
For more information about ranked posets see [19].
One of the most important ranked posets is the Boolean lattice B
n
. For a number n 0
let [n] denote the set 1, 2, . . . , n. The Boolean lattice B
n
= (2
[n]
, ) is the ranked poset
consisting all subsets of [n] , ordered by inclusion. For s 2
[n]
, r(s) is the cardinality of s. It
is convenient to view the elements of B
n
as elements of 0, 1
n
, the set of all n-bit strings.
The order relation is dened by x y i w(x) w(y), where for x = x
1
x
2
. . . x
n
) 0, 1
n
,
w(x) = i[ x
i
= 1, 1 i n. It is easily seen that [w(x)[, also called weight, is a rank on B
n
.
The Boolean lattice B
n
can also be viewed as a bipartite graph. This is the so-called n-cube
(n-hypercube). It has 2
n
vertices, they are the n-tuples of 0s and 1s, called the coordinates
of a vertex. Two vertices x and y with r(x) < r(y) are adjacent by an edge in the hypercube
if and only if they dier exactly by one coordinate, that is, y covers x. It is not hard to see
that the n-cube is a simple, connected, bipartite graph, in which each vertex has degree n.
It is also known that in the n-cube there are n2
n1
edges, it is n-vertex- or edge -connected,
and its diameter is n.
Denition 2. Let T be a ranked poset of rank n. The set x P[ r(x) = m (0 m n)
is called the m level of the poset T. A nite subset C = c
1
, c
2
, . . . , c
k
in T is called
a chain if c
i
< c
i+1
for all i = 0, . . . , k 1. A chain C = c
1
, c
2
, . . . , c
k
is a saturated
chain i it intersects every level between levels r(c
1
) and r(c
k
), that is if c
i+1
covers c
i
for
all i = 0, . . . , k 1. A saturated chain C = c
1
, c
2
, . . . , c
k
in T(X) is called symmetric if
r(c
1
) + r(c
k
) = n.
Clearly in a (symmetric) chain ( = c
1
, c
2
, . . . , c
k
each i ranked element is covered by a
i + 1-ranked element and it covers a i 1-ranked element for all 2 i k 1. We call this
property the monotone property of chains.
In particular, every symmetric chain has an element at level n/2.
Denition 3. Let / = (A, ) be a nite ranked poset. A set ( of chains is called a chain
partition of / = (A, ) or (CP) i each element of A belongs to one and only one chain of
(. If each chain of ( is a symmetric chain, then it is called a symmetric chain partition or
(SCP). If each chain of ( is a saturated chain, then the partition is called a saturated chain
partition or (SaCP) of /.
A useful concept is introduced in [6], that led Griggs, Killian, and Savage to nd a pattern
that gives a nonsimple, monotone, symmetric p-Venn diagram for any prime number p.
Denition 4. [6] Let ( be a SCP in a nite ranked poset / = (A, ) and for each C (,
let starter(C) be the rst element of C and let terminator(C) be the last element of C. Call
4
the longest chains in ( the root chains. Say that ( has the monotone
1
chain cover property
i whenever C ( and C is not a root chain, then there exists a chain (C) ( such that:
(*) starter(C) covers an element
s
(C) of (C) and
(**) terminator(C) is covered by an element
t
(C) of (C).
Call such a mapping a monotone chain cover mapping.
We introduce here a weaker version of Denition 4. We call this the chain cover property.
Denition 5. Let ( be either a SCP or a SaCP in a nite ranked poset / = (A, ) and
for each C (, let starter(C) be the rst element of C and let terminator(C) be the last
element of C. Call the longest chains in ( the root chains. Say that ( has the chain cover
property i whenever C ( and C is not a root chain, then there exists a chain (C) (
and elements
s
(C) and
t
(C) of (C) such that:
(*) starter(C) covers or is covered by
s
(C) of (C),
(**) terminator(C) covers or is covered by
t
(C) of (C), and
(***) the rank of
s
(C) is smaller than the rank of
t
(C).
Call such a mapping a chain cover mapping.
Denition 6. Let ( be a SCP or a SaCP in a nite ranked poset / = (A, ), and suppose
that ( has a unique root chain. In this case can be described by a rooted tree, T((, ),
called a chain cover tree, in which each node corresponds to a chain C ( and the parent of
node C is (C). If there is more than one root chain, we obtain a rooted forest.
Denition 7. Let ( be a SCP or SaCP with the chain cover property for a poset / = (A, ).
Let be a chain cover map for (. The chain cover graph, G((, ), is the graph whose vertices
are the elements of A, and whose edges consist of the covering edges in the chains in (
together with the cover edges, for each non-root chain C (, from:
(*) starter(C) to
s
(C) and
(**) terminator(C) to
t
(C).
The extended chain cover graph eG((, ) is obtained from G((, ) by connecting the rst
elements of the root chains to a special vertex

b and the last elements of the root chains to a

special vertex

t, nally, adding the edge

b,

t.
1
In[6] the word monotone is not used.
5
Denition 8. Let us assume that a ranked poset / = (A, ) is given with an SaCP (
that has the chain-cover property. For every C ( the conict graph coG(C) is dened
as follows. The vertex set of coG(C) is the set of children of C, that is the set
1
(C).
C

, C

is an edge of coG(C), if either

s
(C

) <
s
(C

) <
t
(C

) <
t
(C

) or
s
(C

) <

s
(C

) <
t
(C

) <
t
(C

).
The following theorem is a generalization of Lemma 1 of [6].
Theorem 9. Let / = (A, ) be a ranked poset with an SaCP ( that has the chain-cover
property. The extended chain cover graph eG((, ) has a planar embedding i the conict
graph coG(C) is bipartite for all C (.
Proof. Let us assume rst, that eG((, ) has a planar embedding. For every non-root chain
C ( the part of (C) between
s
(C) and
t
(C) together with C and the covering edges
between starter(C) to
s
(C) and terminator(C) to
t
(C) form a cycle in the graph. Each
child of C must go entirely inside or entirely outside of this cycle in the planar embedding.
For a root chain C
r
the edges between C
r
and

b and

t, respectively, and the edge

b,

t form
a cycle that have the same property as above, that is child of C
r
must go entirely inside
or outside of it. It is easy to see, that if C

and C

are children of C, and they both go

inside (resp. outside) of the cycle, then there is no edge between them in the conict graph
coG(C). That is, the vertices of coG(C) are properly colored with colors inside, outside.
In order to prove the converse, let us assume that all graphs coG(C) are bipartite. The
chains in ( form the rooted forest T((, ). Without loss of generality we may assume that
it is a rooted tree (otherwise we could work componentwise). Use an arbitrary post-order
walk of T((, ), that is an ordering of the chains in ( with the property that children of C
come before C, for all C (. The planar embedding is constructed by induction following
this order. Consider C (. Since coG(C) is bipartite, the children of C can be parti-
tioned into two classes, such that for any two chains C

, C

in the same class the intervals

(
s
(C

),
t
(C

)) and (
s
(C

),
t
(C

)) in chain C either have no common inner point, or one

of them contains the other. (Like non-crossing families.) That is, if we think
s
(C

)s as
left parentheses, and
t
(C

)s as right parentheses, then we obtain a proper parenthesization,

where
s
(C

) is matched with
t
(C

), for all C

. Using that, starting from the innermost

pairs of matched parentheses we can embed the children of C in one class to the left side
of C, and the children in the other (color) class on the right side of C together with their
descendants, as shown on Figure 2. Here we assume that the planar embedding of a child
chain and all its descendants is drawn inside a crescent.
Note, that in [6] the special case of symmetric chain decomposition with a monotone chain
cover property is used. In that case, all graphs coG(C) are edgeless, that is trivially bipartite.
We used the concept of extended chain cover graph eG((, ), since in the applications the
vertices (0, 0, . . . , 0) and (1, 1, . . . , 1) play the role of

b and

t in the constructions of p-doodles.

The following theorem is shown in [2].
Theorem 10. The Boolean lattice B
n
has a SCP.
6
Figure 2: Embedding the descendants of a chain
In [6] another proof of this theorem is given. This SCP is called the Greene-Kleitman SCP,
see [5]. In any SCP every symmetric chain meets the level X
n/2
in one set, thus there must
be
_
n
n/2
_
non-empty symmetric chains in the partition.
It is also shown in [6],
Lemma 11. The Greene-Kleitman SCP of B
n
has the monotone chain cover property for
all positive integer numbers n.
Denition 12. If x = x
1
, x
2
, . . . , x
n1
, x
n
) 0, 1
n
we dene a shift of x by s(x) =
x
n
, x
1
, x
2
, . . . , x
n1
). A rotation of x is a composition of shifts, that is, let s
1
(x) = s(x) and
for i > 1, let s
i
(x) = s(s
i1
(x)). Denote the set of all rotations of all elements of the Boolean
lattice B
n
by o
n
(B
n
) = S
n
.
Denition 13. Dene the relation on 0, 1
n
by x y if y = s
i
(x) for some integer
i 0. Then is an equivalence relation on 0, 1
n
and the equivalences classes are called
cyclic binary code classes, or CBCC. An element x of a class X of CBCC is called a repre-
sentative of the class X.
Denition 14. Let ^
n
be the CBCC of 0, 1
n
and dene the poset of the cyclic binary
code classes, (or PCBCC), ^
n
, by ^
n
= (^
n
, _) with a transitive ordering _ generated by
the rule a
1
_ a
2
if some x a
1
diers from some y a
2
only in one bit i, where x
i
= 0 and
y
i
= 1.
Denition 15. [11] Let B be a subset the Boolean lattice B
n
. An element x (not necessarily
in B) of B
n
is called independent from B, if x cannot be obtained by a shift or a rotation of
any other element of B. A subset B of elements of B
n
is called independent if every element
x of B is independent from B.
Denition 16. [11] A generator ( is a maximal independent subset of the Boolean lattice
B
n
with 1 w(x) n 1, for every x (.
7
Remark 17. It is well known that if p is a prime number, then a set of representatives of
elements of the PCBCC ( = ^
p
0, 0, . . . , 0), 1, 1, . . . , 1) is a generator of the Boolean
lattice 0, 1
n
, and in a generator ( there are exactly

k
=
_
p
k
_
p
elements with weight k, for each 1 k p 1, and thus, there are
=
p1

k=1

k
elements.
Denition 18. Let p be a prime number and let a set of representatives of elements of
( = ^
p
0, 0, . . . , 0), 1, 1, . . . , 1) be a generator for the Boolean lattice B
p
. Let ( be a
CP of ( with the chain cover property and with the chain cover map . The chain cover
graph G((, ) is called a chain cover generator graph (or CCGG). If each chain in ( is
a symmetric chain, then the graph is called a symmetric chain cover generator graph, (or
SCCGG.) If each chain in ( is a saturated chain, then the graph is called a saturated chain
cover generator graph, (or SaCCGG).
The main result in [6] is the following
Theorem 19. For every prime number p there is a SCCGG.
1.2 Venn diagrams
A Venn diagram or an n-Venn diagram consists of n simple closed Jordan curves T =
C
1
, C
2
, . . . , C
n
in the plane such that X
1

X
2

X
n
is a nonempty, connected, open
set (region) (called a face); here, X
i
is either the bounded interior or the unbounded exterior
of C
i
, i = 1, 2, . . . , n. If f is a face and f

C
i
,= is a simple arc, then it is called an edge
of the face f. It is known that the boundary of a face consists of nitely many edges. A face
with k edges (0 < k n) will be called a k-face. One can put various restrictions on the
diagrams and obtain special classes of diagrams. We follow Gr unbaum [7] in the terminology.
We note that each of the 2
n
faces can be described by an n-tuple of zeros and ones where the
ith coordinate is a 0 if X
i
is the unbounded exterior of C
i
, otherwise it is 1, i = 1, 2, . . . , n.
It is clear that there is a one-to-one correspondence between the 2
n
faces of a Venn diagram
and the vertices of the n-dimensional hypercube. If A = X
1

X
2

X
n
is a face of a
Venn diagram then the corresponding n-tuple in the hypercube is called the description of
A. The weight of a face is the weight of the corresponding description.
A Venn diagram is simple if at most two of its curves intersect (transversely) at any point
in the plane. Among the nonsimple Venn diagrams, we will consider only those in which
any two curves meet (not necessarily transversely) in isolated points. With this restriction
on the Venn diagrams it is easy to see that if two faces A and B in a Venn diagram share a
8
common edge, then their descriptions must dier exactly in one coordinate. In this case the
faces are called adjacent. Also it is not hard to see that if two faces A and B dier in their
descriptions in two or more coordinates then the faces cannot share a segment of a curve as
their common boundary.
Two Venn diagrams are isomorphic if, by a continuous deformation of the plane, one of them
can be changed into the other or its mirror image.
A Venn diagram is monotone if for every k, a face with weight k is adjacent to at least one
face with weight (k 1) (for 0 < k) and to at least one face with weight (k +1) (for k < n).
In [1] it was shown that a Venn diagram is isomorphic to a convex Venn diagram (a diagram
of all convex curves), if and only if the diagram is monotone. A. Renyi, K. Renyi, and J.
Suranyi in [16] showed that for every positive integer n there is a convex Venn diagram, and
thus there is a monotone one as well.
To each Venn diagram one can associate two graphs, see [3]. The Venn diagram itself can
be viewed as a planar graph V (T) where all the intersection points of the curves in T are
the vertices of V (T) and the edges of the faces are the edges of V (T). In proper context,
confusion rarely arises from also calling this graph a Venn diagram. In the rest of this paper
the notations T and V (T) are freely interchanged. The Venn diagram V (T) may have mul-
tiple edges. The planar graph dual to V (T) will be called the Venn graph, denoted by D(T).
Quite often we will consider the Venn graph D(T) to be superimposed on the Venn diagram
in the plane, and we will use descriptive statements such as the curve C of T intersects or
crosses the edge e of D(T).
Several interesting properties of Venn diagrams and Venn graphs were derived in [3]. Here
we simply state those properties we need as remarks and refer the reader to [3] for proofs.
Remark 1 The Venn graph D(T) of a Venn diagram V (T) is a planar, spanning
subgraph of the [T[-hypercube.
Remark 2 No two edges of a face of a Venn diagram belong to the same curve.
Remark 3 A Venn graph D(T) is simple, and 2-connected, but the deletion of
any pair of adjacent vertices does not disconnect the graph.
Remark 4 If T is a simple Venn diagram, then each face of D(T) is a quadrilat-
eral, and hence D(T) is a maximal bipartite planar graph.
Remark 5 The Venn graph D(T) of a simple Venn diagram has connectivity 3.
In [11], the Venn graph has been extensively used to study and construct Venn diagrams.
Given a planar graph that meets the conditions described below, an associated Venn diagram
can be constructed, such that the corresponding Venn graph is isomorphic to the original
graph.
9
Denition 20. [11] Let G

be a 2-connected, planar, labeled, spanning subgraph of the n-

hypercube. G

is called a Venn model if

1. To each edge e of G

we assign the index (called the edge number) of the coordinate

where the descriptions of the two end-vertices of e dier;
2. Any two faces of G

share at most one edge with a given edge number; and

3. An edge number that appears on the boundary of a face of G

must appear exactly

twice on that face.
G

is called a simple Venn model if each face of G

is a 4-face and the graph G

is 3-connected.
It is easily seen that every Venn graph D(T) is a Venn model. The construction below shows
that the converse statement holds true as well.
Construction 21. [11] If G

is the Venn model and ^ is an edge numbering with the above

properties, then a Venn diagram T can be constructed in the following way.
Step 1. Create a graph D

(G

) as follows. Place a vertex x

F
in each face F of G

,
and join it to each edge of F by a simple Jordan arc, such that
(i) The arcs inside in a face F meet only at the new vertex x
F
, and
(ii) In every edge of G

exactly two arcs meet.

Step 2. Assign to each simple Jordan arc the edge number of the edge it meets. This
identies each simple closed Jordan curve in the Venn diagram.
Step 3. The set of simple closed Jordan curves created by the procedure above is T.
It is easy to see that the diagram T thus obtained is a Venn diagram, and if for some Venn
diagram T, G

= D(T), then D

(D(T)), is graph-isomorphic to the Venn diagram T.

Now we show
Lemma 22. Let ( be a SCP or a SaCP with the monotone chain cover property for a poset
/ = (A, ), and let be a chain cover map for (. Then a planar embedding P((, ) of the
chain cover graph G((, ) is a Venn model.
Proof. Theorem 9 says that the chain cover graph G((, ) has a planar embedding P((, ).
First we show that P((, ) satises the conditions of Denition 20. Indeed, if an element
c
1
of a chain C ( covers an element c
2
either in the chain C, or c
2
is the terminator(C)
of the chain C and it is covered by the element c
1
=
t
(C), then they dier exactly by one
coordinate, say i, 1 i n. Similarly, if c
1
is the starter(C) of C and it covers an element
c
2
=
s
(C), then they dier exactly by one coordinate, say i, 1 i n. Designate the edge
number i to the edge between c
1
and c
2
. This gives the edge numbering ^ of the edges of
P((, ). The set ^ satises the conditions of Denition 20. Indeed, since between two faces
the boundary is a chain therefore each edge number appears exactly once. The boundary of
10
a face contains two chains intersecting twice at two vertices in two dierent levels, thus an
edge number that appears in a face of P((, ) appears exactly twice in that face, once in
each chain. Since each vertex of P((, ) lies on a cycle, the graph P((, ) is 2-connected.
Finally, according to Construction 21, a diagram T can be constructed by using P((, ) as
the Venn model.
If ( is a SCP or a SaCP with the chain cover property for a poset / = (A, ), and is a
chain cover map for (, then a planar embedding P((, ) of the chain cover graph G((, )
is not necessarily a Venn model. Indeed, property 2. of Denition 20 can be violated if the
cover edges, the two edges connecting a chain to its parent have the same edge number, see
chain C
10
of Table 2 and Figure 6. Let f
1
and f
2
be two faces, and suppose that e
1
, e
2
are
cover edges of a chain and they are on the common boundary of these faces with the same
edge number, say i. These edges are called parallel cover edges. Note that property 2. of
Denition 20 can be violated by the following two other types of chains. If the cover edges
of a chain have dierent edge numbers but these cover edges are in reversed order, that is,
starter(C) is covered and terminator(C) covers an element of the parent chain, respectively,
then the cover edges are called reversed cover edges, see chain C
47
of Table 4 and Figure 6.
If the cover edges have dierent edge numbers but one of them, either starter(C) is covered,
or terminator(C) covers an element of the parent chain, respectively, then the cover edges
are called half reversed cover edges, see chain C
45
of Table 4 and Figure 6. Note also that
only these kind of chains with cover edges above can violate property 2. of Denition 20.
Sometimes this can be corrected with the following procedure.
Denition 23. Let P((, ) be a planar embedding of a chain cover graph G((, ) that violates
property 2. of Denition 20. Suppose that either e
1
, e
2
are parallel cover edges of a chain
with the same edge number, say i, or they are reversed cover edges, or they are half reversed
cover edges, and suppose that they are on the common boundary of f
1
and f
2
faces. Let x
1
and x
2
be two nonadjacent vertices of P((, ) and suppose that their binary representation
dier exactly in one bit, say j, and j ,= i. The edge x
1
, x
2
is said to be a crossing edge if
the addition of this edge to the planar graph P((, ) separates one of the faces into two faces,
and in the newly created planar graph the edges e
1
and e
2
are not on the common boundary
of any two faces.
Construction 24.
Suppose that the planar embedding P((, ) of a chain cover graph G((, ) violates property
2. of Denition 20. Choose a set of crossing edges, and add them one by one preserving the
planarity of graph P((, ) until each parallel cover edge pair is separated, and each violation
of property 2. of Denition 20 by reversed or half reversed cover edges are corrected. The
newly constructed planar graph is a Venn model. Now some of the old edges of the graph
P((, ) can be deleted without violating Denition 20. Delete them until you cannot delete
any more old edge without violating Denition 20. The obtained planar graph P

((, ) is
called a minimal Venn model.
This procedure is illustrated in Lemma 38 and Figures 6 and 8.
11
Using Eulers Theorem for planar graphs [F[ + [V [ [E[ = 2 (where [F[ is the number of
faces, [V [ is the number of vertices, and [E[ is the number of edges of the graph), an easy
argument ([10]) shows that the number of vertices [V [ of a Venn diagram with n curves
satises the inequality

2
n
2
n 1
[V [ 2
n
2.
1.3 Symmetric Venn diagrams
A Venn diagram of n curves is said to be symmetric if a rotation through 360/n degrees
map the family of curves onto itself, that is, the diagram is not changed by the rotation. It
is clear that curves of a symmetric Venn diagram can be obtained by n successive rotations
through 360/n degrees of any of the curves. It is not hard to see that an n-Venn diagram is
symmetric i the descriptions of two faces are rotations (cyclic permutations) of each other,
then the faces are congruent. In particular, choosing a representative of each congruence
class, a symmetric n-Venn diagram can be reconstructed by rotating successively the cho-
sen faces about one given point through angles of 360/n degrees [15]. A symmetric Venn
(n-Venn) diagram will be called a doily (n-doily).
Symmetric Venn diagrams have been studied by several researchers including Henderson [15],
Gr unbaum [8, 9], Schwenk [18], Edwards [4], Ruskey [17], Hamburger [10, 11, 14], Hamburger
and Sali [12, 13], and recently Griggs, Killian, and Savage [6]. For the brief history of results
on symmetric Venn diagrams see [10]. It is known (see [15]) that symmetric Venn diagrams
do not exist for composite numbers n.
Let p be an arbitrary xed prime number. By the rotational symmetry, the cardinality of
the vertex set [V [ of a p-doily must meet the following conditions [11]
(i)
2
p
2
p1
[V [ 2
p
2,
(ii) p is a divisor of [V [.
In the trivial case p = 2, [V [ = 2 is uniquely determined, the conditions are obvious. In what
follows we assume p 3. Properties (i) and (ii) obviously hold for
p1
, and by Fermats
little theorem, 2
p1
1 (mod p), also 2
p
2 satises both conditions. The rst number
provides non-simple p-doily for every prime number p, and the second number is a candidate
for [V [ of a simple p-doily, but only known to exist for the cases p = 3, 5, 7.
Notation 25. We denote by
/
p
=
__
p
p1
2
_
,
_
p
p1
2
_
+ p,
_
p
p1
2
_
+ 2p, . . . , 2
p
2
_
=
p1
,
p1
+p,
p1
+2p, . . . ,
2
p
2
,
the set of numbers between the two numbers mentioned above and satisfying (i) and (ii).
Also, let

p
=
_
_
p
p1
2
_
p
,
_
p
p1
2
_
p
+ 1,
_
p
p1
2
_
p
+ 2, . . . ,
2
p
2
p
_
=
p1
,
p1
+ 1,
p1
+ 2, . . . ,
2
p
2
.
12
Again, for p = 3, 5, 7 every element of / represents [V [ for a suitably constructed doily [11].
Our main topic in this paper is to explore the case p = 11. In [10] the case
111
= 462
and in [11] the cases 462, 462 + 11, 462 + 22, . . . , 462 + 54 11 = 1001 are settled. In
this paper applying another method based on saturated chains we construct 11-doilies for
627, 627 + 11, 627 + 22, . . . , 627 + 110 11 = 1837. In our next paper we return to the prob-
lem of the remaining numbers between 1837 and 2
11
2 = 2046. It is remarkable that this
gap 2046 1837 = 209 is exactly the cardinality of the conjectured minimal 11-doily. The
cases 220, 220 + 11, . . . , 220 + 24 11 = 484 are settled in [14] based on a third approach,
however the single remaining case 209 eluded us so far. In [6] the cardinality
p1
for prime
numbers p 11 have been settled. It can be seen that their construction extends to the
cases 462+11, 462+22, . . . , 1276, however that construction does not seem to go beyond 1276.
Denition 26. [11] A p-doodle is a subgraph G of the p-hypercube with the following prop-
erties:
1. The set ( of descriptions of the vertex set G is a generator set,
2. s(a) [ a (, s o
p
0, 0, . . . , 0), 1, 1, . . . , 1) is a set of descriptions of a
2-connected, spanning, planar subgraph of the p-hypercube, where o
p
is dened in
Denition 12.
Note that the elements of set
p
are possible number of faces of a p-doodle.
The following procedure describes one of the methods of [11]. This shows how can a p-Venn
model of a p-doily be constructed from a p-doodle. This is illustrated by Figures 8 and 9, as
well as Figures 13 and 14.
Construction 27.
Let G be a doodle, and let C
1
be a 2/p sector of a circle C with center c. Let H be a planar
embedding of the graph G into the interior of C
1
. We add as vertices the center point c and
the innite point c

to the graph H. We may suppose that the vertex having weight p 1

of the graph H can be connected to c and the vertex with weight 1 can be connected to
c

preserving the planar graph property. Adding these edges we denote the extended graph
by G
0
. We assign the p-tuples 1, 1, . . . , 1) and 0, 0, . . . , 0) to the vertices c and c

as their
descriptions, respectively. These descriptions are also denoted by c and c

. We associate to
shift s = s
1
the rotation of the plane by angle = 2/p around c, and the rotation is also
denoted by s
1
. The rotated copies of G
0
are denoted by
G
j
= s
j
(G
0
), (0 j < p).
Given a vertex s
j
(v) G
j
, v G
0
, we assign the p-tuple s
j
(d) to s
j
(v) as its description if
and only if d is the description of the vertex v. Note that s
j
(c) = c, s
j
(c

) = c

. Let the graph

D(G) =
p1
j=0
G
j
, where e is an edge of D(G) if and only if it is an edge of some G
j
. This graph
D(G) is graph-isomorphic to a 2-connected, spanning, labeled subgraph of the p-hypercube.
Assign a number between 1 and p to each edge of D(G) corresponding to the coordinate
13
where the descriptions of the two end-vertices of the edge dier. If the graph D(G) satises
all conditions of Denition 20, then the created graph is called the p-Venn model of a p-doily.
Using the method of Construction 21 with the Venn model of a doily, a Venn diagram is
constructed. This diagram is graph-isomorphic to a doily.
Lemma 28. Let p be a prime number and let a set of representatives of elements of ( =
^
p
0, 0, . . . , 0), 1, 1, . . . , 1) be a generator for the Boolean lattice B
p
. Let ( be a CP
of ( with the monotone chain cover property and with the chain cover map , and suppose
that each conict graph is bipartite. Then the planar embedding P((, ) of the chain cover
graph G((, ) with that transformation set o
p
(B
p
) (see Denition 12) is a p-doodle of a p-
doily. Suppose that ( is a CP of ( with the chain cover property and it has a minimal Venn
model V ((, ), then the minimal Venn model V ((, ) with that transformation set o
p
(B
p
) is
a p-doodle of a p-doily.
Proof. Remark 17, Lemma 22 shows that the planar embedding P((, ) of the chain
cover graph G((, ) with the set o
p
(B
p
) is a p-doodle. Finally, if this p-doodle is used in
Construction 27, then a p-doily is obtained.
Remark 29. Let p be a prime number, and let a set of representatives of elements of ( =
^
p
0, 0, . . . , 0), 1, 1, . . . , 1) be a generator for the Boolean lattice B
p
. Let ( be a CP of
( with the monotone chain cover property and with the chain cover map . Since each chain
C has the monotone property, thus any p-doily which is received from the p-doodle described
in Lemma 28 is a monotone Venn diagram, and thus it is isomorphic to a p-doily which can
be drawn with all convex curves.
Remark 30. A Venn diagram constructed from a minimal Venn model may or may not be
monotone. All Venn diagrams created below are nonmonotone.
Recall that the vertices, edges, and faces of a Venn model correspond to the faces, edges, and
vertices of the Venn diagram, respectively. Note that some of the pairs of vertices in a graph
of a doodle may be connected by an edge, without violating the conditions of Denition 20,
obtaining a new graph of a doodle. Every time a set of new edges is added to the graph of a
doodle, the number of edges of the corresponding Venn model is increased by a multiple of
p. This increases number of vertices of the corresponding doily by a multiple of p. Note also
that in the Venn model of a doily, sometimes p symmetric pairs of vertices from dierent
images of G
1
can be connected by p edges without violating the conditions of Denition 20.
Adding these p edges, a new Venn model of a doily is created. This also increases the number
of vertices of the corresponding doily by p. This procedure is illustrated in Figures 13 and 14.
Denition 31. [11] A doodle or a Venn model is called extendable if some pairs of the
vertices of the graph of the doodle can be connected by an edge, and/or p symmetric pairs
of vertices from dierent images of G
1
of the corresponding Venn model can be connected
by p edges without violating the conditions of Denition 20. It is fully extendable if it is
extendable, and the resulting Venn model of a doily is a 3-connected graph having all 4-faces.
14
Let p be a xed prime number.
Denition 32. A p-Venn model G of a doodle of a p-doily G

is called minimal if after

deletion of any edge e of G the rotation of G p-many times does not result in a p-Venn
model G

1
. A p-Venn model of a p-doily is called minimal if it is constructed as it is described
in Construction 27 from a minimal p-Venn model G.
Denition 33. A minimal p-Venn model of a doodle G is called chain-minimal if it is the
edge disjoint union of saturated chains. A chain-minimal p-Venn model is called minimum
chain-minimal if its cardinality is
p1
, that is, if each chain is a symmetric chain.
Every p-Venn model which is created from a SCP of the Boolean lattice is minimum chain-
minimal, and thus according to [6] there is a minimum chain-minimal p-doodle for all prime
numbers p.
Now, our approach is the following. Given a prime number p, and an integer m
p
, nd
a chain-minimal SaCCGG G, [G(L)[ = m (where G(L) is the number of faces of G), apply
the shift p 1 times getting a p-Venn model, and then extend it as much as possible, hoping
that it is fully extendable. In the next section we prove the following
Theorem 34. For p = 11 and 60
11
there exists a chain-minimal SaCCGG G, [G(L)[ =
60. This creates a minimal 11-Venn model with 627 faces, and thus an 11-doily with 627
vertices.
In Section 3 we show
Theorem 35. The minimal 11-Venn model of Theorem 34 is extendable with 110 edges to
a Venn model of 1837 faces.
The proof of Theorem 34 is given in the next section in a series of lemmas and by an explicit
table of vertices. The proof of Theorem 35 relies upon the extension of the underlying 11-
doodle by adding 96 internal edges and 11 external edges. The details are shown in the
gures.
2 A chain-minimal saturated chain cover generator graph
(SaCCGG) with 60 saturated chains, for an 11-doily
with 627 vertices.
To create a p-doily we follow the following procedure: First we choose a generator, a set of
binary p-tuples. Next we partition this set into the set of saturated chains. Now we specify
a chain cover map . We check whether satises the chain cover property, or the monotone
chain cover property. If one of them holds, then from the set of saturated chains with the
help of the chain cover map we create a chain cover tree, and all of its conict graphs.
Using Theorem 9 and the chain cover tree we check whether the set of saturated chains has
a planar embedding. If the answer is armative, then we create an extended chain cover
graph, and its planar drawing. Now we check whether property 2. of Denition 20 is satised.
15
If not we add crossing edges until it is corrected. (If property 2. is satised, then we skip
this step.) If it is possible, then we delete some old edges without violating Denition 20
in order to created a minimal Venn model of a doodle. From the minimal Venn model of a
doodle we create a minimal Venn model of a doily. Finally from the minimal Venn model of
a doily the doily itself is created, and the required Jordan curve can be obtained.
After then we add edges to the minimal Venn model of a doodle, if it is possible, adding them
one by one, or any subset of edges, to create other doodles, and thus other nonisomorphic
doilies. We do this until a maximal Venn model of a doodle created, thus a doily with a
maximal vertex set. This procedure is illustrated for p = 11 in the next two sections.
Now we choose a set of binary 11-tuples, a generator, see Table 1. Note that nding a
generator for any xed prime integer p is algorithmically determined; it is similar to par-
tition problems that have been already been studied in combinatorics and number theory.
Thus nding all doodles for any xed prime integer p with an exhaustive search is also
determined. Hence nding a suitable doodle for any xed prime number p is determined
as well. We do not know any algorithm to nd one desired doodle without nding all of them.
It is tedious but not hard to check that the set of 11-tuples in Table 1 satises the conditions
of a generator. (In order to make Table 1 shorter we write the binary 11-tuples by indicating
the locations of 1s and we omit the 0s. For example 1, 6 corresponds to 1000010000.
By doing this it is easier to locate the binary 11-tuples in Figure 8.) The edge numbers of
the Venn model of the doodle can be seen in Figure 6. Recall that an edge number is the
location of the new 1 in the end vertex, as generated by the binary codes of Table 1. From
the generator we create the Venn model of the doodle.
Lemma 36. For p = 11 there exists a SaCP of the 11-hypercube with 60 saturated chains.
There is a chain cover map , this chain cover map satises the chain cover property.
Proof. Tables 2,3 and 4 show the representatives of the cyclic binary code classes partitioned
into 60 saturated chains. In the tables the (C),
s
(C), and
t
(C) denote the parent of the
chain C, the rst element of the parent chain and the second element of the parent chain
that connect the chain to the parent chain, respectively.
It is easy to check that the binary 11-tuples of Table 1 correspond to the SaCP of Tables 3, 2
and 4.
Figure 3 shows the chain cover tree with 60 saturated chains.
Lemma 37. The conict graphs of the chain cover tree of Figure 3 are all bipartite and thus
the extended chain cover graph is planar.
Proof. From the chain cover tree it is easy to see that there are only a few conict trees,
and they have only few edges. Figures 4 and 5 show the conict graphs of the chain cover
16
w(v) = 1 # w(v) = 10 # w(v) = 3 # w(v) = 5 # w(v) = 6 #
1 1 1-10 186 1,6,3 7 1,6,3,7,9 52 1,6,3,7,9,5 94
w(v) = 2 # w(v) = 9 # 1,3,8 8 1,6,3,4,7 53 1,6,3,7,9,2 95
1,6 2 1,6,3,4,7,5,2,8,9 181 1,3,9 9 1,6,3,10,4 54 1,6,3,7,9,4 96
1,3 3 1,3,8,6,2,7,9,10,4 182 1,3,5 10 1,6,3,10,7 55 1,6,3,4,7,5 97
1,5 4 1,3,9,4,6,5,8,2,10 183 1,5,6 11 1,3,8,6,10 56 1,6,3,10,7,4 98
1,9 5 1,9,5,10,2,6,7,4,8 184 1,5,2 12 1,3,8,6,7 57 1,3,8,6,10,7 99
1,2 6 1,2,6,4,8,3,7,10,5 185 1,5,10 13 1,3,8,6,9 58 1,3,8,6,7,4 100
w(v) = 4 # w(v) = 7 # 1,9,5 14 1,3,8,6,2 59 1,3,8,6,7,9 101
1,6,3,7 22 1,6,3,7,9,5,2 136 1,9,6 15 1,3,8,10,2 60 1,3,8,6,9,10 102
1,6,3,4 23 1,6,3,7,9,2,4 137 1,9,10 16 1,3,8,10,9 61 1,3,8,6,2,9 103
1,6,3,10 24 1,6,3,7,9,4,5 138 1,9,2 17 1,3,8,9,2 62 1,3,8,6,2,7 104
1,3,8,6 25 1,6,3,4,7,5,2 139 1,2,10 18 1,3,9,2,10 63 1,3,8,10,2,6 105
1,3,8,2 26 1,6,3,10,7,4,5 140 1,2,6 19 1,3,9,2,6 64 1,3,8,10,9,2 106
1,3,8,10 27 1,3,8,6,10,7,4 141 1,2,3 20 1,3,9,4,2 65 1,3,9,2,6,10 107
1,3,8,9 28 1,3,8,6,7,4,9 142 1,2,7 21 1,3,9,4,8 66 1,3,9,2,6,4 108
1,3,9,2 29 1,3,8,6,7,9,10 143 w(v) = 8 # 1,3,9,4,6 67 1,3,9,4,2,10 109
1,3,9,4 30 1,3,8,6,9,10,2 144 1,6,3,7,9,2,4,5 166 1,3,9,6,5 68 1,3,9,4,8,2 110
1,3,9,6 31 1,3,8,6,2,7,9 145 1,6,3,4,7,5,2,8 167 1,3,9,5,4 69 1,3,9,4,8,10 111
1,3,9,5 32 1,3,9,2,6,10,4 146 1,6,3,10,7,4,5,2 168 1,3,9,5,2 70 1,3,9,4,8,5 112
1,3,5,2 33 1,3,9,4,2,10,5 147 1,3,8,6,10,7,4,9 169 1,3,5,2,8 71 1,3,9,4,6,8 113
1,3,5,4 34 1,3,9,4,8,2,10 148 1,3,8,6,2,7,9,10 170 1,3,5,2,4 72 1,3,9,4,6,5 114
1,3,5,6 35 1,3,9,4,8,5,10 149 1,3,9,2,6,10,4,8 171 1,3,5,4,8 73 1,3,9,5,4,2 115
1,5,6,10 36 1,3,9,4,6,5,8 150 1,3,9,4,8,2,10,5 172 1,3,5,4,6 74 1,3,9,5,2,8 116
1,5,6,2 37 1,3,9,5,2,8,4 151 1,3,9,4,6,5,8,2 173 1,3,5,6,10 75 1,3,5,2,4,8 117
1,5,2,9 38 1,3,5,4,6,8,10 152 1,3,5,4,6,8,10,2 174 1,5,6,10,2 76 1,3,5,4,6,8 118
1,5,10,2 39 1,3,5,6,10,2,4 153 1,3,5,6,10,2,4,9 175 1,5,6,2,3 77 1,3,5,6,10,4 119
1,9,5,10 40 1,5,6,2,3,4,9 154 1,9,5,10,2,6,4,8 176 1,5,2,9,6 78 1,3,5,6,10,2 120
1,9,6,5 41 1,5,6,2,3,9,10 155 1,9,5,10,2,6,7,4 177 1,9,5,10,2 79 1,5,6,2,3,4 121
1,9,10,6 42 1,9,5,10,2,6,4 156 1,9,2,10,6,4,8,7 178 1,9,6,5,10 80 1,5,6,2,3,9 122
1,9,2,10 43 1,9,5,10,2,6,7 157 1,2,6,4,8,9,7,3 179 1,9,10,6,7 81 1,9,5,10,2,6 123
1,2,10,6 44 1,9,6,5,10,7,8 158 1,2,6,4,8,3,7,10 180 1,9,10,6,8 82 1,9,6,5,10,8 124
1,2,6,9 45 1,9,10,6,8,7,2 159 1,9,2,10,6 83 1,9,6,5,10,7 125
1,2,6,4 46 1,9,2,10,6,7,4 160 1,2,6,9,4 84 1,9,10,6,8,7 126
1,2,6,3 47 1,9,2,10,6,4,8 161 1,2,6,4,10 85 1,9,2,10,6,7 127
1,2,3,4 48 1,2,6,4,8,9,7 162 1,2,6,4,8 86 1,9,2,10,6,4 128
1,2,3,7 49 1,2,6,4,8,9,3 163 1,2,6,3,4 87 1,2,6,4,10,8 129
1,2,7,6 50 1,2,6,4,8,3,7 164 1,2,3,4,8 88 1,2,6,4,8,9 130
1,2,7,4 51 1,2,7,6,4,8,10 165 1,2,3,4,7 89 1,2,6,4,8,3 131
1,2,3,7,8 90 1,2,3,4,7,8 132
1,2,7,6,3 91 1,2,7,6,3,4 133
1,2,7,6,4 92 1,2,7,6,4,8 134
1,2,7,4,8 93 1,2,7,4,8,10 135
Table 1: A generator. w(v) denotes the weight of the vertex v. In row 2 at number 186 the
1 10 denotes the 11-tuple 1, 3, 9, 4, 6, 5, 8, 2, 10, 7.
17
# # (C),
s
(C),
t
(C) # (C),
s
(C),
t
(C)
C
1
Root C
2
, C
1
, 1, 186 C
3
, C
1
1, 186
1 1 2 1,6 5 1,9
3 1,3 7 1,6,3 14 1,9,5
9 1,3,9 23 1,6,3,4 40 1,9,5,10
30 1,3,9,4 53 1,6,3,4,7 79 1,9,5,10,2
67 1,3,9,4,6 97 1,6,3,4,7,5 123 1,9,5,10,2,6
114 1,3,9,4,6,5 139 1,6,3,4,7,5,2 157 1,9,5,10,2,6,7
150 1,3,9,4,6,5,8 167 1,6,3,4,7,5,2,8 177 1,9,5,10,2,6,7,4
173 1,3,9,4,6,5,8,2 181 1,6,3,4,7,5,2,8,9 184 1,9,5,10,2,6,7,4,8
183 1,3,9,4,6,5,8,2,10 # (C),
s
(C),
t
(C) # (C),
s
(C),
t
(C)
186 1,3,9,4,6,5,8,2,10,7 C
4
, C
1
, 1, 186 C
5
, C
1
, 3, 186
# (C),
s
(C),
t
(C) 6 1,2 8 1,3,8
C
6
C
1
3 183 19 1,2,6 25 1,3,8,6
10 1,3,5 46 1,2,6,4 59 1,3,8,6,2
35 1,3,5,6 86 1,2,6,4,8 104 1,3,8,6,2,7
75 1,3,5,6,10 131 1,2,6,4,8,3 145 1,3,8,6,2,7,9
120 1,3,5,6,10,2 164 1,2,6,4,8,3,7 170 1,3,8,6,2,7,9,10
153 1,3,5,6,10,2,4 180 1,2,6,4,8,3,7,10 182 1,3,8,6,2,7,9,10,4
175 1,3,5,6,10,2,4,9 185 1,2,6,4,8,3,7,10,5 # (C),
s
(C),
t
(C)
# (C),
s
(C),
t
(C) # (C),
s
(C),
t
(C) C
7
C
2
7, 181
C
8
C
7
52, 166 C
9
C
7
52, 166 22 1,6,3,7
94 1,6,3,7,9,5 96 1,6,3,7,9,4 52 1,6,3,7,9
136 1,6,3,7,9,5,2 138 1,6,3,7,9,4,5 95 1,6,3,7,9,2
# (C),
s
(C),
t
(C) # (C),
s
(C),
t
(C) 137 1,6,3,7,9,2,4
C
10
C
2
7, 139 C
12
C
5
25, 182 166 1,6,3,7,9,2,4,5
24 1,6,3,10 56 1,3,8,6,10 # (C),
s
(C),
t
(C)
55 1,6,3,10,7 99 1,3,8,6,10,7 C
11
C
10
24, 98
98 1,6,3,10,7,4 141 1,3,8,6,10,7,4 54 1,6,3,10,4
140 1,6,3,10,7,4,5 169 1,3,8,6,10,7,4,9 # (C),
s
(C),
t
(C)
168 1,6,3,10,7,4,5,2 # (C),
s
(C),
t
(C) C
13
C
5
59, 145
# (C),
s
(C),
t
(C) C
14
C
5
25, 170 103 1,3,8,6,2,9
C
15
C
5
25, 170 58 1,3,8,6,9 # (C),
s
(C),
t
(C)
57 1,3,8,6,7 102 1,3,8,6,9,10 C
16
C
15
57, 101
101 1,3,8,6,7,9 144 1,3,8,6,9,10,2 100 1,3,8,6,7,4
143 1,3,8,6,7,9,10 # (C),
s
(C),
t
(C) 142 1,3,8,6,7,4,9
# (C),
s
(C),
t
(C) C
18
C
5
8, 59 # (C),
s
(C),
t
(C)
C
17
C
5
8, 59 27 1,3,8,10 C
19
C
18
27, 60
26 1,3,8,2 60 1,3,8,10,2 61 1,3,8,10,9
105 1,3,8,10,2,6 106 1,3,8,10,9,2
Table 2: (C),
s
(C), and
t
(C) denote the parent of the chain C, the rst element of
the parent chain and the second element of the parent chain that connect the chain to the
parent chain, respectively. The numbers, (bold faced or not), are the listing numbers of the
11-tuples in Table 1.
18
# (C),
s
(C),
t
(C) # (C),
s
(C),
t
(C) # (C),
s
(C),
t
(C)
C
20
C
19
61, 106 C
21
C
1
9, 183 C
22
C
21
29, 107
28 1,3,8,9 29 1,3,9,2 63 1,3,9,2,10
62 1,3,8,9,2 64 1,3,9,2,6 # (C),
s
(C),
t
(C)
# (C),
s
(C),
t
(C) 107 1,3,9,2,6,10 C
23
C
21
64, 146
C
24
C
1
30, 183 146 1,3,9,2,6,10,4 108 1,3,9,2,6,4
66 1,3,9,4,8 171 1,3,9,2,6,10,4,8 # (C),
s
(C),
t
(C)
110 1,3,9,4,8,2 # (C),
s
(C),
t
(C) C
25
C
24
110, 172
148 1,3,9,4,8,2,10 C
26
C
24
66, 148 65 1,3,9,4,2
172 1,3,9,4,8,2,10,5 111 1,3,9,4,8,10 109 1,3,9,4,2,10
# (C),
s
(C),
t
(C) # (C),
s
(C),
t
(C) 147 1,3,9,4,2,10,5
C
27
C
24
66, 172 C
28
C
1
67, 150 # (C),
s
(C),
t
(C)
112 1,3,9,4,8,5 113 1,3,9,4,6,8 C
29
C
1
9, 114
149 1,3,9,4,8,5,10 # (C),
s
(C),
t
(C) 31 1,3,9,6
# (C),
s
(C),
t
(C) C
30
C
1
9, 173 68 1,3,9,6,5
C
31
C
30
70, 151 32 1,3,9,5 # (C),
s
(C),
t
(C)
33 1,3,5,2 70 1,3,9,5,2 C
32
C
31
33, 117
72 1,3,5,2,4 116 1,3,9,5,2,8 71 1,3,5,2,8
117 1,3,5,2,4,8 151 1,3,9,5,2,8,4 # (C),
s
(C),
t
(C)
# (C),
s
(C),
t
(C) # (C),
s
(C),
t
(C) C
33
C
30
32, 151
C
34
C
6
10, 153 C
35
C
34
34, 118 69 1,3,9,5,4
34 1,3,5,4 73 1,3,5,4,8 115 1,3,9,5,4,2
74 1,3,5,4,6 # (C),
s
(C),
t
(C) # (C),
s
(C),
t
(C)
118 1,3,5,4,6,8 C
36
C
6
75, 153 C
37
C
6
75, 120
152 1,3,5,4,6,8,10 119 1,3,5,6,10,4 36 1,5,6,10
174 1,3,5,4,6,8,10,2 # (C),
s
(C),
t
(C) 76 1,5,6,10,2
# (C),
s
(C),
t
(C) C
38
C
3
14, 123 # (C),
s
(C),
t
(C)
C
39
C
38
77, 122 4 1,5 C
40
C
38
4, 122
121 1,5,6,2,3,4 11 1,5,6 12 1,5,2
154 1,5,6,2,3,4,9 37 1,5,6,2 38 1,5,2,9
# (C),
s
(C),
t
(C) 77 1,5,6,2,3 78 1,5,2,9,6
C
41
C
3
40, 79 122 1,5,6,2,3,9 # (C),
s
(C),
t
(C)
13 1,5,10 155 1,5,6,2,3,9,10 C
42
C
3
123, 184
39 1,5,10,2 # (C),
s
(C),
t
(C) 156 1,9,5,10,2,6,4
# (C),
s
(C),
t
(C) C
43
C
3
5, 184 176 1,9,5,10,2,6,4,8
C
45
C
43
43, 178 17 1,9,2 # (C),
s
(C),
t
(C)
16 1,9,10 43 1,9,2,10 C
44
C
43
83, 178
42 1,9,10,6 83 1,9,2,10,6 127 1,9,2,10,6,7
82 1,9,10,6,8, 128 1,9,2,10,6,4 160 1,9,2,10,6,7,4
126 1,9,10,6,8,7 161 1,9,2,10,6,4,8
159 1,9,10,6,8,7,2 178 1,9,2,10,6,4,8,7
Table 3: (C),
s
(C), and
t
(C) denote the parent of the chain C, the rst element of
the parent chain and the second element of the parent chain that connect the chain to the
parent chain, respectively. The numbers, (bold faced or not), are the listing numbers of the
11-tuples in Table 1.
19
# (C),
s
(C),
t
(C) # (C),
s
(C),
t
(C) # (C),
s
(C),
t
(C)
C
46
C
45
42, 126 C
47
C
45
42, 126 C
48
C
47
80, 158
81 1,9,10,6,7 15 1,9,6 124 1,9,6,5,10,8
# (C),
s
(C),
t
(C) 41 1,9,6,5 # (C),
s
(C),
t
(C)
C
49
C
4
6, 19 80 1,9,6,5,10 C
50
C
4
19, 46
18 1,2,10 125 1,9,6,5,10,7 45 1,2,6,9
44 1,2,10,6 158 1,9,6,5,10,7,8 84 1,2,6,9,4
# (C),
s
(C),
t
(C) # (C),
s
(C),
t
(C) # (C),
s
(C),
t
(C)
C
51
C
4
46, 86 C
52
C
4
86, 164 C
53
C
52
130, 179
85 1,2,6,4,10 130 1,2,6,4,8,9 163 1,2,6,4,8,9,3
129 1,2,6,4,10,8 162 1,2,6,4,8,9,7 # (C),
s
(C),
t
(C)
# (C),
s
(C),
t
(C) 179 1,2,6,4,8,9,7,3 C
54
C
4
19, 131
C
55
C
4
6, 164 # (C),
s
(C),
t
(C) 47 1,2,6,3
20 1,2,3 C
56
C
55
48, 132 87 1,2,6,3,4
48 1,2,3,4 88 1,2,3,4,8 # (C),
s
(C),
t
(C)
89 1,2,3,4,7 # (C),
s
(C),
t
(C) C
57
C
55
20, 132
132 1,2,3,4,7,8 C
58
C
4
6, 180 49 1,2,3,7
# (C),
s
(C),
t
(C) 21 1,2,7 90 1,2,3,7,8
C
59
C
58
50, 92 50 1,2,7,6 # (C),
s
(C),
t
(C)
91 1,2,7,6,3 92 1,2,7,6,4 C
60
C
58
21, 165
133 1,2,7,6,3,4 134 1,2,7,6,4,8 51 1,2,7,4
165 1,2,7,6,4,8,10 93 1,2,7,4,8
135 1,2,7,4,8,10
Table 4: Tables 2, 3, and 4 show the vertices and edges of a chain-minimal saturated chain
cover generator graph with 60 saturated chains. (C),
s
(C), and
t
(C) denote the parent
of the chain C, the rst element of the parent chain and the second element of the parent
chain that connect the chain to the parent chain, respectively. The numbers, (bold faced or
not), are the listing numbers of the 11-tuples in Table 1.
20
Figure 3: The chain cover tree with 60 saturated chains
21
30 29
21 6
2 3 4
5 28 24
26 27
25
41
42 43
38
Figure 4: Three conict graphs of the chain cover tree of Figure 3
49 51 52
54 55 58
50
12 14 15
18 17 13
34 36 37
Figure 5: Three conict graphs of the chain cover tree of Figure 3
tree of Figure 3. They are all trivially bipartite and thus the extended chain cover graph is
planar. Figure 6 is a planar drawing of the extended chain cover graph.

Note that the extended chain cover graph is not a Venn model of a doodle.
Lemma 38. There is a minimal Venn model of the doodle obtained from the extended chain
cover graph of Figure 6. This can be obtained by the procedure of Construction 24. This
graph has 57 faces.
Proof. The cover edges of the following chains are parallel: C
10
, C
16
, C
18
, C
19
, C
20
, C
25
, C
31
,
C
37
, C
39
, C
41
, C
49
, C
50
, C
51
, C
52
and C
59
, while chain C
47
has reversed cover edges, nally
chain C
45
has half reversed cover edges. The three, two, four, and two chains in the follow-
ing four sets of chains C
18
, C
19
, C
20
, C
37
, C
39
, C
49
, C
50
, C
51
, C
52
, and C
45
, C
47
violate
property 2. of Denition 20 in one single but in four dierent faces. All the other chains
listed here violates property 2. of Denition 20 in other dierent faces. Furthermore, chains
C
18
, C
19
, C
20
, and C
45
, C
47
are connected with cover edges, see Figure 3. Adding 16 crossing
edges one can create a doodle of a Venn model. Table 5 shows the crossing edges. In the
table the crossing edges are represented by a pair of numbers; these numbers are from Table 1.
It is easy to check that by adding these crossing edges we create a Venn model of an 11-
doodle, see Figure 7. To create a minimal Venn model of a 11-doodle the following 20 edges
can be removed without violating Denition 20. Table 6 lists the set of removable edges.
The resulting graph is in Figure 8
22
Figure 6: The extended chain cover graph
23
Figure 7: The extended chain cover graph with the added crossing edges
24
98, 141 142, 169 62, 29 106, 63
30, 65 10, 33 174, 183 37, 76
154, 175 4, 13 5, 15 44, 83
84, 128 85, 128 130, 161 49, 91
Table 5: A list of the crossing edges
101, 142 25, 59 27, 60 62, 106
29, 63 64, 107 65, 110 148, 172
36, 120 77, 122 13, 40 15, 42
128, 161 19, 44 46, 84 46, 85
86, 131 50, 91 75, 120 67, 114
Table 6: A list of the removable edges
The obtained minimal Venn model of a 11-doodle has 57 feces and thus the non-simple 11-
doily created from this doodle has 11 57 = 627 vertices. Indeed, the 60 chains create 61
faces. The added 16 crossing edges add another 16 faces, this is altogether 77 faces. The
removed 20 edges lower this number to 57 faces. The minimal Venn model of the 11-doodle
with the edge numbers is shown in Figure 6.
The 11-doily with the vertex set of size 627 is in Figure 10. The intersection of the interior
of one of the Jordan curves and the 11-doily can be seen in Figure 11. Finally the Jordan
curve that creates this doily is in Figure 12. All of the gures of a Venn model of a doily (or
a Venn model of a doodle) have some vertices that are incident to edges that have only one
end, with the understanding that in the exterior they are all incident with the single vertex
< 0, 0, . . . , 0 >.
25
Figure 8: A minimal Venn model of a doodle of a non-simple 11-doily with 627 vertices and
with the edge numbers. The edge numbers are from Table 1.
26
Figure 9: A minimal Venn model of the 11-doily with the vertex set of size 627.
27
Figure 10: A non-simple 11-doily with 627 vertices.
28
Figure 11: The intersection of the interior of one of the Jordan curves and the 11-doily from
Figure 10. The outer contour of this gure is one of the Jordan curves in the non-simple
11-doily with 627 vertices.
29
Figure 12: The Jordan curve, and the center of rotation. The rotation of this curve 11 times
over 360/11 degrees creates the non-simple 11-doily with 627 vertices in Figure 10.
30
3 A maximal Venn model and the 11-doily with 1837
vertices
Note that the graph of this doodle is extendable. The vertices of the Venn model of the
doodle which can be connected without violating Denition 20 can be seen in Figure 13. In
addition, all of the eleven pairs of vertices can be connected between two consecutive copies
of the doodle. Figure 13 also shows all the edge numbers created by these new edges. In
Figure 13 there are 110 new pairs of vertices, that is 110 new edges. This is the maximum
number of new edges that can be added to this model of the doodle without violating De-
nition 20.
These edges can be added one-by-one. Also one can add any set of these edges to the model
of the doodle. 110 steps, each adding one new edge, to create 110 dierent 11-doilies with
vertex sets 627, 627 + 11, . . . , 1837. Adding any subset of this edge set to the model of the
doodle creates 2
110
dierent apparently non-isomorphic models. Combining the extension
with deletion of edges may provide even more new models, we did not however explore this
road.
With limited space for publication we only show here the maximal Venn model of the doodle
in which all of the possible pairs of vertices are connected without violating Denition 20.
This is in Figure 13. Figure 14 shows the Venn model of the doily. Figure 15 shows the
11-doily which is created by this Venn model. Figure 16 shows the intersection of the interior
of one of the Jordan curves and the 11-doily in Figure15. Figure 17 shows the Jordan curve.
The rotation of this curve over 360/11 degrees creates the non-simple 11-doily with 352
vertices.
In Figures 10 and 15 there are 2048 faces, 627 or 1837 vertices, and 2076 or 3883 edges, re-
spectively. The diculty is to show a decent drawing of such diagrams in a paper of limited
size.
4 Problems and conjectures
Conjecture 39. For every integer n 2 and for every k /
n
there is a SaCP ( of the
Boolean lattice B
n
such that [([ = k, (see /
n
in Notation 21).
Problem 40. Is it possible to construct the SaCP in Conjecture 39 with the chain cover
property?
Remark 41. Note that the SaCP following from our construction is not unique, some have
the chain cover property, some others do not.
Problem 42. For every prime number p and for any m
p
there is a chain-minimal
SaCCGG G such that [G(L)[ = m, (see
p
in Notation 25).
Conjecture 43. For every prime number p there is a fully extendable p-Venn model. Is
there a chain-minimal SaCCGG, such that the conjectured model is corresponding to it?
31
Figure 13: A maximal Venn model of a doodle of a non-simple 11-doily with 1837 vertices.
The new edges added to the Venn model of the doodle of Figure 6. The edge numbers are
from Table 1.
32
Figure 14: A maximal Venn model of a non-simple 11-doily with 1837 vertices.
33
Figure 15: A non-simple 11-doily with 1837 vertices.
34
Figure 16: The intersection of the interior of one of the Jordan curves and the 11-doily from
Figure 15. The outer contour of this gure is one of the Jordan curves in the non-simple
11-doily with 1837 vertices.
35
Figure 17: The Jordan curve, and the center of rotation. The rotation of this curve 11 times
over 360/11 degrees creates the non-simple 11-doily with 1837 vertices in Figure 15.
36
Problem 44. For every prime number p there is a
p
and a SaCCGG G, [G(L)[ = ,
such that the corresponding p-Venn model is fully extendable.
Problem 45. For every prime number p and for every k /
p
is there a minimum chain-
minimal p-Venn model with k-many saturated chains which is fully extendable?
The statements of Conjecture 42, Problems 44, and 45 look redundant. In fact it is not true
that each Venn model of a doily can be constructed by a Venn model of a doodle! It is not
hard to check that some of the 7-doilies of [17] cannot be constructed this way.
Problem 46. Is there a minimum chain-minimal p-Venn model G which is generated by
a SCCGG G

, and which is fully extendable? In particular, is it possible to modify the

construction of [6] to obtain such SCCGG for any prime number p > 7?
Remark 47. For prime numbers p = 2, 3, 5, and 7 the requested SCCGG in Problem 46
exists, this is shown in [11].
Problem 48. Find either a necessary, or a sucient, or a necessary and sucient condition
to correct the violation of property 2. of Denition 20 in a planar extended chain cover graph.
5 Acknowledgment
The authors thank Professor Adam Coman and the referees for their valuable suggestions.
The gures were created by artist Edit Hepp; they are her intellectual properties; and she
has all the copyrights. The authors are deeply thankful to her for letting these marvelous
images be used in this paper.
References
[1] B. Bultena, B. Gr unbaum, and F. Ruskey, Convex drawings of intersecting fam-
ilies of simple closed curves, (preprint) (1998).
[2] N. G. de Bruijn, C. Tengbergen, and D. Kruyswijk, On the set of divisors of
a number, Nieuw. Arch. Wiskunde (2) 23 (1951), 191193.
[3] K. B. Chilakamarri, P. Hamburger and R. E. Pippert, Venn diagrams and
planar graphs, Geometriae Dedicata 62 (1996), 7391.
[4] A. W. F. Edwards, Seven-set Venn diagrams with rotational and polar symmetry,
Combinatorics, Probability, and Computing, 7 (1998), 149152.
[5] C. Green and D. J. Kleitman, Strong version of Sperners theorem, Journal of
Combinatorial Theory Ser. A 20/1 (1976), 8088.
[6] J. Griggs, C. E. Killian, and C. D. Savage, Venn diagrams and symmetric chain
decompositions in the Boolean lattice, (preprint).
[7] B. Gr unbaum, Venn diagrams I, Geombinatorics 1 (1992), 512.
37
[8] B. Gr unbaum, Venn diagrams II, Geombinatorics 2 (1992), 2532.
[9] B. Gr unbaum, The search for symmetric Venn diagrams, Geombinatorics 8 (1999),
104109.
[10] P. Hamburger, Doilies and doodles, Discrete Mathematics 257/2-3 (2002), 423439,
a Special Issue in Honor of the 65th Birthday of Daniel J. Kleitman.
[11] P. Hamburger, Pretty drawings. More doodles and doilies, symmetric Venn dia-
grams, Utilitas Mathematica, (in print).
[12] P. Hamburger and A. Sali, Symmetric 11-Venn diagrams with vertex sets
231, 242, . . . , 352, Studia Mathematica Hungarica, 40/1-2 (2003), 121143.
[13] P. Hamburger and A. Sali, 11-Doilies with Vertex Sets 275, 286, . . . 462, (submit-
ted).
[14] P. Hamburger, Assigning binary bit string codes to planar regions using symmetric
Venn diagrams, (in preparation).
[15] D. W. Henderson, Venn diagrams for more than four classes, Mathematics Magazine
4 (1963), 424426.
[16] A. R enyi, K. R enyi, and J. Sur anyi, Sur lindependance des domaines simples
dans lespace Euclidien a n-dimensions, Colloquium Mathematicum 2 (1951), 130135.
[17] F. Ruskey, A survey of Venn diagrams, The Electronic Journal of Combinatorics, 4
(1997), DS#5. see also: http://sue.csc.uvic.ca/ cos/venn/VennEJC.html.
[18] A. J. Schwenk, Venn diagram for ve curves, Mathematics Magazine 57 (1984), 297.
[19] R. Stanley, Enumerative Combinatorics, Cambridge University Press, Volume 1,
(1997), and Volume 2, 1999.
38