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

Abstract

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.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    V. A. Liskovec: The number of eulerian digraphs and regular tournaments (Russian)Vesci Akad. Navuk BSSR Ser. Fiz.-Mat. Navuk,1 (1971) 22–27.

    Google Scholar 

  2. [2]

    B. D. McKay: Applications of a technique for labelled enumeration,Congressus Numerantium,40 (1983) 207–221.

    Google Scholar 

  3. [3]

    B. D.McKay, and X.Wang: Asymptotic enumeration of tournaments with a given score sequence, in preparation.

  4. [4]

    B. D.McKay, and N. C.Wormald: Asymptotic enumeration of graphs with a given degree sequence,Europ. J. Combin., to appear.

  5. [5]

    J. H. Spencer: Random regular tournaments,Period. Math. Hungar.,5 (1974) 105–120.

    Article  Google Scholar 

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

McKay, B.D. The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs. Combinatorica 10, 367–377 (1990). https://doi.org/10.1007/BF02128671

Download citation

AMS subject classification (1980)

  • 05 C 30
  • 05 C 20