An upper bound for the number of Eulerian orientations of a regular graph

Abstract

We establish a new upper bound for the number of Eulerian orientations of a regular graph with even degrees.

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

References

  1. [1]

    M. Las Vergnas, Le polynÔme de Martin d'un graphe eulérien,Ann. Discrete Math.,17 (1983), 397–411.

    Google Scholar 

  2. [2]

    B.McKay, The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs,Combinatorica to appear.

  3. [3]

    A. Schrijver, Bounds on the number of Eulerian orientations,Combinatorica,3 (1983), 375–380.

    Google Scholar 

Download references

Author information

Affiliations

Authors

Additional information

C.N.R.S., Paris with partial support of P.R.C. Mathématiques-Informatique.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Vergnas, M.L. An upper bound for the number of Eulerian orientations of a regular graph. Combinatorica 10, 61–65 (1990). https://doi.org/10.1007/BF02122696

Download citation

AMS subject classification (1980)

  • 05C20
  • 05C30