Large connected strongly regular graphs are Hamiltonian
arXiv:1409.3041
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.
9 pages