ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A finite graph is rr-regular if every vertex has degree rr, and a Hamilton cycle is a cycle containing every vertex of the graph exactly once.

Sheehan's conjecture. There is no finite rr-regular graph with a unique Hamilton cycle for any r>2r>2.

This conjecture concerns whether uniqueness of a Hamilton cycle can occur in finite regular graphs of degree greater than two. It is still open, although partial results have been proved.

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.