Asymptotic enumeration of Eulerian circuits for graphs with strong mixing properties
classification
🧮 math.CO
keywords
asymptoticcircuitseuleriangraphsmixingnumberpropertiesstrong
read the original 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 $O(n^{-1/2+\varepsilon})$, where $n$ is the number of vertices
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.