2000 character limit reached
Asymptotic enumeration of Eulerian circuits for graphs with strong mixing properties (1210.2491v2)
Published 9 Oct 2012 in math.CO
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
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.