Asymptotic behavior of the number of Eulerian orientations of graphs

Mikhail Isaev (1)

1 CMAP - Centre de Mathématiques Appliquées - Ecole Polytechnique

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

Domaines: Combinatoire [math.CO]

Mikhail Isaev. Asymptotic behavior of the number of Eulerian orientations of graphs. 2012. ⟨hal-00631251v5⟩