ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an NN-regular graph on nn 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 N≥⌊n2⌋N\geq \left\lfloor\frac{n}{2}\right\rfloor, then GG 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 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.