arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2503.18554math.COcs.DM
收藏

驳斥两个关于Venn图Hamilton性的猜想

Disproving two conjectures on the Hamiltonicity of Venn diagrams

Universität Kassel(卡塞尔大学);Universität Potsdam(波茨坦大学)

Sofia Brenner, Linda Kleist, Torsten Mütze, Christian Rieck, Francesco Verciani

AI总结:

本研究驳斥了关于Venn图Hamilton性的两个猜想,通过构造反例证明了Winkler猜想和非简单Venn图Hamilton性猜想的不成立。

摘要:

1984年,Winkler猜想每一个简单的Venn图 with n条曲线都可以扩展为一个简单的Venn图 with n+1条曲线。他的猜想等价于任何简单的Venn图的对偶图都有一个Hamilton回路。在本工作中,我们为所有n≥6的情况构造了Winkler猜想的反例。作为证明的一部分,我们计算了所有3430404个简单的Venn图 with n=6条曲线(即使它们的数量之前未知),其中我们发现了72个反例。我们还构造了单调Venn图,即可以用n个凸曲线绘制且不可扩展的图,对于所有n≥7。此外,我们还驳斥了另一个关于Venn图(原图)Hamilton性的猜想。具体而言,在研究Winkler猜想时,Pruesse和Ruskey证明了对于每个简单的Venn图 with n条曲线,该图都有一个Hamilton回路,并猜想这一结论也适用于非简单的图。我们为所有n≥4的情况构造了该猜想的反例。

英文摘要:

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. We also construct monotone Venn diagrams, i.e., diagrams that can be drawn with $n$ convex curves, and are not extendable, for all $n\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 $n$ curves, and conjectured that this also holds for non-simple diagrams. We construct counterexamples to this conjecture for all $n\geq 4$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑