Buratti-Horak-Rosa conjecture on edge lengths of Hamiltonian paths
Statement
Let denote the vertices of a circulant instance, and let edge length refer to the corresponding circulant edge-length class, for . Let be nonnegative integers, where counts the edges of length .
Buratti-Horak-Rosa conjecture. If
and, for every divisor of ,
then there exists a Hamiltonian path on using exactly edges of length for each .
The conjecture characterizes the combinations of edge lengths that can occur in a Hamiltonian path and asserts that the divisibility inequalities are the only obstruction. Its prime-order case was conjectured by Buratti in the 2000s; the supplied text gives no evidence that the full conjecture has been resolved.
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.