English

Disproving two conjectures on the Hamiltonicity of Venn diagrams

Combinatorics 2026-01-13 v4 Discrete Mathematics

Abstract

In 1984, Winkler conjectured that every simple Venn diagram with nn curves can be extended to a simple Venn diagram with n+1n+1 curves. His conjecture is equivalent to the statement that the dual graph of any simple Venn diagram has a Hamilton cycle. In this work, we construct counterexamples to Winkler's conjecture for all n6n\geq 6. As part of this proof, we computed all 3.430.404 simple Venn diagrams with n=6n=6 curves (even their number was not previously known), among which we found 72 counterexamples. We also construct monotone Venn diagrams, i.e., diagrams that can be drawn with nn convex curves, and are not extendable, for all n7n\geq 7. Furthermore, we also disprove another conjecture about the Hamiltonicity of the (primal) graph of a Venn diagram. Specifically, while working on Winkler's conjecture, Pruesse and Ruskey proved that this graph has a Hamilton cycle for every simple Venn diagram with nn curves, and conjectured that this also holds for non-simple diagrams. We construct counterexamples to this conjecture for all n4n\geq 4.

Keywords

Cite

@article{arxiv.2503.18554,
  title  = {Disproving two conjectures on the Hamiltonicity of Venn diagrams},
  author = {Sofia Brenner and Linda Kleist and Torsten Mütze and Christian Rieck and Francesco Verciani},
  journal= {arXiv preprint arXiv:2503.18554},
  year   = {2026}
}