Asymptotic behavior of the number of Eulerian orientations of graphs
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
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.