Large connected strongly regular graphs are Hamiltonian
classification
🧮 math.CO
keywords
connectedregularstronglygraphshamiltonianproveapartconjectures
read the original abstract
We prove that every connected strongly regular graph on sufficiently many vertices is Hamiltonian. We prove this by showing that, apart from three families, connected strongly regular graphs are (highly) pseudo-random. Our results suggest a number of new questions and conjectures.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.