The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs (Q805627): Difference between revisions

The author determines the asymptotic values of the number of labelled regular tournaments, labelled loop-free simple Eulerian digraphs, and labelled loop-free simple Eulerian oriented digraphs on n vertices, respectively. The last two classes of graphs are also enumerated by their numbers of edges. The method in each case is to identify the required quantity as a coefficient in an n-variable power series, and estimate it by applying the saddle-point method to an appropriate n-dimensional integral.