Sheehan's conjecture on uniquely Hamiltonian regular graphs
Statement
A finite graph is -regular if every vertex has degree , and a Hamilton cycle is a cycle containing every vertex of the graph exactly once.
Sheehan's conjecture. There is no finite -regular graph with a unique Hamilton cycle for any .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.