The Hamiltonian decomposition conjecture for regular graphs
Statement
Let be an -regular graph on vertices. A Hamiltonian cycle is a cycle that meets every vertex, and a perfect matching is a matching covering every vertex. The Hamiltonian decomposition conjecture. If , then has a decomposition into Hamiltonian cycles and at most one perfect matching. The conjecture predicts a Hamiltonian decomposition at the natural degree threshold; the source presents it as a related conjecture and gives no 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.