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}
}
Let RT (n), ED(n) and EOG(n) be the number of labelled regular tournaments, labelled loop-free simple Eulerian digraphs, and labelled Eulerian oriented simple graphs, respectively, on n vertices. Then, as n →∞, RT (n) = (2n+1 πn )(n−1)/2 n1/2e−1/2 ( 1 + O(n−1/2+ ) ) (n odd), ED(n) = ( 4 πn )(n−1)/2 n1/2e−1/4 ( 1 + O(n−1/2+ ) ) , and EOG(n) = (3n+1 4πn )(n−1)/2 n1/2e−3/8 ( 1 + O(n−1/2+ ) ) , for any > 0. The last two families of graphs are also enumerated by their numbers of edges. The proofs… CONTINUE READING

From This Paper

Topics from this paper.
22 Citations
3 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Random regular tournaments, Period

  • J. H. Spencer
  • Math. Hungar.,
  • 1974
Highly Influential
4 Excerpts

Applications of a technique for labelled enumeration

  • B. D. McKay
  • Congressus Numerantium,
  • 1983
2 Excerpts

Liskovec, The number of eulerian digraphs and regular tournaments (Russian

  • V A.
  • Vesci Akad. Navuk BSSR Ser. Fiz.-Mat. Navuk,
  • 1971
1 Excerpt

Similar Papers

Loading similar papers…