The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs (Q805627): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q3344226 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Asymptotic enumeration of tournaments with a given score sequence / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Asymptotic enumeration by degree sequence of graphs of high degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Random regular tournaments / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02128671 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1991825372 / rank | |||
Normal rank |
Latest revision as of 10:56, 30 July 2024
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
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
regular tournaments
0 references
Eulerian digraphs
0 references
Eulerian oriented digraphs
0 references