Asymptotic enumeration of Eulerian circuits for graphs with strong mixing properties

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 $O(n^{-1\mathrm{/}2+\epsilon })$, where $n$ is the number of vertices