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

From MaRDI portal
scientific article
Language Label Description Also known as
English
The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
scientific article

    Statements

    The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs (English)
    0 references
    0 references
    1990
    0 references
    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.
    0 references
    0 references
    regular tournaments
    0 references
    Eulerian digraphs
    0 references
    Eulerian oriented digraphs
    0 references
    0 references
    0 references