Aichholzer–Orthaber–Vogtenhuber's plane Hamiltonian-connectedness conjecture
Statement
Let be the complete graph, and let a simple drawing be a drawing in which vertices are distinct points, edges are simple curves joining their endpoints and avoiding other vertices, and every two edges meet at most once, either at a common endpoint or at a proper crossing. A plane Hamiltonian path is a Hamiltonian path whose edges do not cross.
Aichholzer–Orthaber–Vogtenhuber's conjecture. For each pair of vertices in a simple drawing of , there exists a plane Hamiltonian path from to .
This is a strengthening of Rafla's conjecture, requiring Hamiltonian paths with every prescribed pair of endpoints. The source introduces it as a variant of Rafla's conjecture; its general status remains open.
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.