Large connected strongly regular graphs are Hamiltonian
From MaRDI portal
Publication:6254539
arXiv1409.3041MaRDI QIDQ6254539FDOQ6254539
Authors: Laszló Pyber 
Publication date: 10 September 2014
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 page was built for publication: Large connected strongly regular graphs are Hamiltonian
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6254539)
