ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG) be a dd-regular graph on at most 2d2d vertices.

Nash-Williams' conjecture. GG contains ⌊d/2⌋\lfloor d/2 \rfloor 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 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.