Asymptotic enumeration of Eulerian circuits for graphs with strong mixing properties

preprint2013arXivOpen access

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Asymptotic enumeration of Eulerian circuits for graphs with strong mixing properties

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0