Counterexamples to two conjectures on Venn diagrams

In 1984, Winkler conjectured that every simple Venn diagram with $n$ curves can be extended to a simple Venn diagram with $n+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 $n\geq 6$. As part of this proof, we computed all 3.430.404 simple Venn diagrams with $n=6$ curves (even their number was not previously known), among which we found 72 counterexamples. While working on Winkler's conjecture, Pruesse and Ruskey considered the (multi)graph whose vertices are the crossings of the curves of a Venn diagram and curve segments between consecutive crossings form the edges. They proved that this graph has a Hamilton cycle for every simple Venn diagram with $n$ curves, and conjectured that this also holds for non-simple diagrams. We construct counterexamples to this conjecture for all $n\geq 4$.