Nash-Williams' Hamilton decomposition conjecture for regular graphs
Statement
Let ) be a -regular graph on at most vertices.
Nash-Williams' conjecture. contains edge-disjoint Hamilton cycles.
Nash-Williams proposed this as a best-possible strengthening of the known lower bound for graphs of minimum degree at least half their order; the stated upper bound follows from the number of edges. The source does not provide evidence of resolution.
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.