Papers › Using SAT to study plane Hamiltonian substructures in simple drawings
Using SAT to study plane Hamiltonian substructures in simple drawings
Helena Bergold, Stefan Felsner, Meghana M. Reddy, Manfred Scheucher
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In 1988 Rafla conjectured that every simple drawing of a complete graph Kₙ contains a plane, i.e., non-crossing, Hamiltonian cycle. The conjecture is far from being resolved. The lower bounds for plane paths and plane matchings have recently been raised to (logn)¹⁻ᵒ⁽¹⁾ and Ω(√(n)), respectively. We develop a SAT framework which allows the study of simple drawings of Kₙ. Based on the computational data we conjecture that every simple drawing of Kₙ contains a plane Hamiltonian subgraph with 2n-3 edges. We prove this strengthening of Rafla's conjecture for convex drawings, a rich subclass of simple drawings. Our computer experiments also led to other new challenging conjectures regarding plane substructures in simple drawings of complete graphs.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections