ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KnK_n 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 s,ts,t in a simple drawing of KnK_n, there exists a plane Hamiltonian path from ss to tt.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.