Asymptotic enumeration of Eulerian circuits for graphs with strong mixing properties
Combinatorics
2015-06-11 v2
Abstract
We prove an asymptotic formula for the number of Eulerian circuits for graphs with strong mixing properties and with vertices having even degrees. The exact value is determined up to the multiplicative error , where is the number of vertices
Keywords
Cite
@article{arxiv.1210.2491,
title = {Asymptotic enumeration of Eulerian circuits for graphs with strong mixing properties},
author = {Mikhail Isaev},
journal= {arXiv preprint arXiv:1210.2491},
year = {2015}
}