Pyber's conjecture on Hamiltonian cycles in distance-regular graphs
Statement
A distance-regular graph is a connected regular graph whose distance partition around every vertex has the same intersection numbers; connected strongly regular graphs are exactly the distance-regular graphs of diameter . Pyber's conjecture. Connected distance-regular graphs are Hamiltonian with finitely many exceptions. The paper proves that all sufficiently large connected strongly regular graphs are Hamiltonian, giving evidence for this broader conjecture, but the general statement remains open.
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.