The regular-subgraph conjecture for Hamilton-cycle packings
Statement
Let be a graph on vertices, and let denote the largest degree of an even-regular spanning subgraph of . The regular-subgraph conjecture. If
then contains at least
edge-disjoint Hamilton cycles. This graph-by-graph strengthening of the preceding conjecture is best possible for each individual graph. It was proved when , but remains open 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.