Pruesse–Ruskey Hamiltonicity conjecture for Venn-diagram graphs
Statement
For an -Venn diagram, consider the graph whose vertices are the crossings of the curves and whose edges are the curve segments between consecutive crossings; this graph may have multiple edges. Pruesse and Ruskey's conjecture. For , the graph of any (not necessarily simple) -Venn diagram has a Hamilton cycle.
Pruesse and Ruskey proved the corresponding statement for simple Venn diagrams, using 4-connectivity and Tutte's theorem. The conjecture asks whether Hamiltonicity continues to hold for non-simple Venn diagrams; this paper is concerned with disproving such conjectures.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.