2000 character limit reached
Asymptotic behavior of the number of Eulerian orientations of graphs (1110.2598v6)
Published 12 Oct 2011 in math.CO
Abstract: We consider the class of simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the Laplacian matrix). For this class of graphs we determine the asymptotic behavior of the number of Eulerian orientations. In addition, we establish some new properties of the Laplacian matrix, as well as an estimate of a conditionality of matrices with the asymptotic diagonal predominance
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.