ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KvK_v denote the complete graph on {0,1,…,v−1}\{0,1,\dots,v-1\}, and let ℓ(H)\ell(H) be the multiset of edge-lengths of a graph HH, with edge lengths in KvK_v defined by ℓ(x,y)=min⁡(∣x−y∣,v−∣x−y∣)\ell(x,y)=\min(|x-y|,v-|x-y|). Horak–Rosa conjecture. Let LL be a list of v−1v-1 positive integers not exceeding ⌊v/2⌋\lfloor v/2\rfloor. Then there exists a Hamiltonian path HH of KvK_v such that ℓ(H)=L\ell(H)=L if and only if, for every divisor dd of vv, the number of multiples of dd appearing in LL does not exceed v−dv-d. 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 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.