Horak–Rosa Hamiltonian path conjecture
Statement
Let denote the complete graph on , and let be the multiset of edge-lengths of a graph , with edge lengths in defined by . Horak–Rosa conjecture. Let be a list of positive integers not exceeding . Then there exists a Hamiltonian path of such that if and only if, for every divisor of , the number of multiples of appearing in does not exceed . The conjecture generalizes Buratti's problem to arbitrary orders and is stated in the paper as still widely open, with partial results known.
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.