09-25-2026, 01:26 PM
The “A Survey of Venn Diagrams” by Frank Ruskey and Mark Weston is a broad combinatorial and geometric survey of Venn diagrams, originally published as a Dynamic Survey in 1997 and updated through 2005. The authors treat Venn diagrams not simply as illustrations of set intersections, but as mathematical objects with rich combinatorial, graph-theoretic, geometric, and topological structure. An $n$-Venn diagram consists of $n$ closed curves arranged so that all $2^n$ possible combinations of inside/outside regions occur, with every such region connected. Thus, for three curves there are $2^3=8$ regions, while an $n$-diagram necessarily contains $2^n$ regions. The survey also distinguishes Venn diagrams from Euler diagrams, which may omit some of these combinations.
A major theme is the construction and classification of Venn diagrams. Venn's original construction adds curves successively, with each new curve dividing every existing region into two. Edwards developed another inductive construction that introduces considerable symmetry and leads to attractive graph-theoretic structures. The survey represents a Venn diagram as a planar graph and studies its dual graph, whose vertices correspond to the $2^n$ regions. Adjacent regions differ in exactly one membership bit, so the dual graph is a spanning subgraph of the $n$-dimensional hypercube $Q_n$. For a simple Venn diagram, Euler's formula gives particularly elegant formulas: if $v$ is the number of vertices and $e$ the number of edges, then $v=2^n-2$ and $e=2^{n+1}-4$.
The survey devotes substantial attention to symmetry. A rotationally symmetric $n$-Venn diagram is invariant under rotations by multiples of $2\pi/n$. A striking result is that such a diagram can exist only when $n$ is prime: the $\binom nk$ regions corresponding to the $k$-element subsets must be distributed equally among the $n$ rotational sectors, requiring $n\mid\binom nk$ for every $1\le k<n$. Later work by Griggs, Killian, and Savage produced a construction of symmetric Venn diagrams for every prime $n$. Their construction connects Venn diagrams with Boolean lattices, chains, and necklaces, and produces diagrams with $\binom{n}{\lfloor n/2\rfloor}$ vertices, which is the minimum possible for monotone Venn diagrams.
Finally, the survey explores enumeration, minimality, extendibility, monotonicity, and open problems. For example, there are six Venn classes and fourteen diagrams for $n=3$, while the complete number of diagrams becomes difficult to determine as $n$ grows. For simple diagrams the number of vertices is fixed at $2^n-2$, but non-simple diagrams can have fewer vertices; a general lower bound is $\left\lceil(2^n-2)/(n-1)\right\rceil$. For monotone Venn diagrams, the minimum number of vertices is exactly $\binom n{n/2}$ (with the appropriate interpretation for odd $n$). The survey also connects extendibility to Hamiltonian cycles in associated graphs. One particularly notable historical open question was whether simple symmetric Venn diagrams exist for more than seven curves; the survey records increasingly complex examples for $n=11$ and beyond.
Key takeaways
Read the full “A Survey of Venn Diagrams”
A major theme is the construction and classification of Venn diagrams. Venn's original construction adds curves successively, with each new curve dividing every existing region into two. Edwards developed another inductive construction that introduces considerable symmetry and leads to attractive graph-theoretic structures. The survey represents a Venn diagram as a planar graph and studies its dual graph, whose vertices correspond to the $2^n$ regions. Adjacent regions differ in exactly one membership bit, so the dual graph is a spanning subgraph of the $n$-dimensional hypercube $Q_n$. For a simple Venn diagram, Euler's formula gives particularly elegant formulas: if $v$ is the number of vertices and $e$ the number of edges, then $v=2^n-2$ and $e=2^{n+1}-4$.
The survey devotes substantial attention to symmetry. A rotationally symmetric $n$-Venn diagram is invariant under rotations by multiples of $2\pi/n$. A striking result is that such a diagram can exist only when $n$ is prime: the $\binom nk$ regions corresponding to the $k$-element subsets must be distributed equally among the $n$ rotational sectors, requiring $n\mid\binom nk$ for every $1\le k<n$. Later work by Griggs, Killian, and Savage produced a construction of symmetric Venn diagrams for every prime $n$. Their construction connects Venn diagrams with Boolean lattices, chains, and necklaces, and produces diagrams with $\binom{n}{\lfloor n/2\rfloor}$ vertices, which is the minimum possible for monotone Venn diagrams.
Finally, the survey explores enumeration, minimality, extendibility, monotonicity, and open problems. For example, there are six Venn classes and fourteen diagrams for $n=3$, while the complete number of diagrams becomes difficult to determine as $n$ grows. For simple diagrams the number of vertices is fixed at $2^n-2$, but non-simple diagrams can have fewer vertices; a general lower bound is $\left\lceil(2^n-2)/(n-1)\right\rceil$. For monotone Venn diagrams, the minimum number of vertices is exactly $\binom n{n/2}$ (with the appropriate interpretation for odd $n$). The survey also connects extendibility to Hamiltonian cycles in associated graphs. One particularly notable historical open question was whether simple symmetric Venn diagrams exist for more than seven curves; the survey records increasingly complex examples for $n=11$ and beyond.
Key takeaways
- An $n$-Venn diagram has exactly $2^n$ regions, representing every possible subset of the $n$ sets.
- Venn diagrams can be studied as planar graphs, with their dual graphs embedded in the Boolean hypercube $Q_n$.
- For a simple $n$-Venn diagram:
- Regions: $2^n$
- Vertices: $2^n-2$
- Edges: $2^{n+1}-4$
- Regions: $2^n$
- The $k$-regions correspond naturally to the $\binom nk$ subsets of size $k$.
- Rotationally symmetric Venn diagrams require $n$ to be prime, because $n$ must divide $\binom nk$ for every $1\le k<n$.
- Edwards' construction connects Venn diagrams to hypercubes, Boolean lattices and bipartite planar graphs.
- The problem is not merely geometric: Venn diagrams have deep connections to graph theory, combinatorics, topology and order theory.
- For monotone Venn diagrams, the minimum number of vertices is $\binom n{\lfloor n/2\rfloor}$.
- The survey shows how apparently elementary diagrams can lead to difficult enumeration and existence problems.
- A useful teaching connection is the correspondence
sets → binary strings → Boolean lattice → hypercube → planar graph, providing a bridge from elementary set theory to advanced combinatorics.
Read the full “A Survey of Venn Diagrams”
┌────────────────────────────────┐
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘