Papers
Topics
Authors
Recent
Search
2000 character limit reached

Asymptotic enumeration of Eulerian circuits for graphs with strong mixing properties

Published 9 Oct 2012 in math.CO | (1210.2491v2)

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

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Mikhail Isaev 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up