Nash-Williams's regular-subgraph conjecture for Hamilton-cycle packings
Statement
For a graph , let be the largest degree of an even-regular spanning subgraph of . For integers and , define
Nash-Williams's conjecture. If is a graph on vertices with minimum degree , then contains at least
edge-disjoint Hamilton cycles. This is the natural optimal bound based on the largest guaranteed even-regular spanning subgraph; the paper presents it as an open problem in general.
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.