Asymptotic behaviour of the number of eulerian circuits

Research output: Contribution to journalArticleResearchpeer-review


We determine the asymptotic behaviour of the number of Eulerian circuits in undirected simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the Laplacian matrix). We also prove some new properties of the Laplacian matrix.
Original languageEnglish
Article numberP219
Number of pages35
JournalThe Electronic Journal of Combinatorics
Issue number1
Publication statusPublished - 2011
Externally publishedYes

Cite this