We prove an asymptotic formula for the number of Eulerian orientations for graphs with strong mixing properties and with vertices having even degrees. The exact value is determined up to the multiplicative error O(n1+ε), where n is the number of vertices.
|Translated title of the contribution||Asymptotic enumeration of eulerian orientations for graphs with strong mixing properties|
|Number of pages||19|
|Journal||Diskretnyi Analiz i Issledovanie Operatsii|
|Publication status||Published - 2013|