# The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs

@article{McKay1990TheAN,
title={The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs},
author={Brendan D. McKay},
journal={Combinatorica},
year={1990},
volume={10},
pages={367-377}
}
• B. McKay
• Published 1 December 1990
• Mathematics, Computer Science
• Combinatorica
LetRT(n), ED(n) andEOG(n) be the number of labelled regular tournaments, labelled loop-free simple Eulerian digraphs, and labelled Eulerian oriented simple graphs, respectively, onn vertices. Then, asn→∞,, for anyε>0. The last two families of graphs are also enumerated by their numbers of edges. The proofs use the saddle point method applied to appropriaten-dimensional integrals.

## Topics from this paper

Asymptotic enumeration of Eulerian digraphs with multiple edges
• Xiaoji Wang
• Mathematics, Computer Science
Australas. J Comb.
• 1992
Let ED ME ( n, t) be the number of labelled loop-free eulerian digraphs with n vertices in which the multiplicity of each edge is at most t, and allow loops to be considered.
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
• Mathematics, Computer Science
Comb. Probab. Comput.
• 1998
The asymptotic behaviour of the number of Eulerian circuits in a complete graph of odd order is determined and exact values for up to 21 nodes are given.
Packing 4-Cycles in Eulerian and Bipartite Eulerian Tournaments with an Application to Distances in Interchange Graphs
Abstract.We prove that every Eulerian orientation of Km,n contains $\tfrac{1} {{4 + \sqrt 8 }}mn(1 - o(1))$ arc-disjoint directed 4-cycles, improving earlier lower bounds. Combined with a
Tournaments with many Hamilton cycles
The object of interest is the maximum number, h(n), of Hamilton cycles in an n-tournament. By considering the expected number of Hamilton cycles in various classes of random tournaments, we obtain
Random Sampling of Euler Tours
• Mathematics, Computer Science
Algorithmica
• 2001
It is proved that the chain is rapidly mixing if the maximum degree in the given graph is 6, thus obtaining an efficient algorithm for sampling and counting the set of Euler tours for such an Eulerian graph.
Subgraphs of Dense Random Graphs with Specified Degrees
• B. McKay
• Mathematics, Computer Science
Combinatorics, Probability and Computing
• 2011
This work proves some basic facts about the structure of a random graph with degree sequence d, including the probability of a given subgraph or induced subgraph, using the multidimensional saddle-point method.
On the class of graphs with strong mixing properties
• Mathematics, Computer Science
• 2012
We study three mixing properties of a graph: large algebraic connectivity, large Cheeger constant (isoperimetric number) and large spectral gap from 1 for the second largest eigenvalue of the
Random Sampling of Euler Tours
• Mathematics, Computer Science
RANDOM
• 1997
It is proved that the chain is rapidly mixing if the maximum degree in the given graph is 6, thus obtaining an efficient algorithm for sampling and counting the set of Euler tours for such an Eulerian graph.
Asymptotic behavior of the number of Eulerian orientations of graphs
The class of simple graphs with large algebraic connectivity (the second minimal eigenvalue of the Laplacian matrix) is considered. For graphs of this class, the asymptotic behavior of the number of
A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
• Computer Science, Mathematics
Combinatorics, Probability and Computing
• 2008
It is shown that for each α>0 every sufficiently large oriented graph G with δ+(G), δ−(G)≥3|G|/8+α|G• contains a Hamilton cycle, and this confirms a conjecture of Häggkvist [10].

## References

SHOWING 1-6 OF 6 REFERENCES
APPLICATIONS OF A TECHNIQUE FOR LABELLED ENUMERATION
A technique involving summation over roots of unity was used by Liskovec in 1971 to count labelled regular tournaments. The same method is used here to count regular tournaments to 21 vertices,
Asymptotic Enumeration by Degree Sequence of Graphs of High Degree
• Computer Science, Mathematics
Eur. J. Comb.
• 1990
This work considers the estimation of the number of labelled simple graphs with degree sequence d 1, d 2, . . . , d n by using an n-dimensional Cauchy integral and gives as a corollary the asymptotic joint distribution function of the degrees of a random graph.
Random regular tournaments, Period
• Math. Hungar
• 1974
Liskovec, The number of eulerian digraphs and regular tournaments (Russian
• Vesci Akad. Navuk BSSR Ser. Fiz.-Mat. Navuk,
• 1971
The number of eulerian digraphs and regular tournaments (Russian) Vesci Akad
• Navuk BSSR Ser. Fiz.-Mat. Navuk
• 1971