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

DOI10.1007/BF02128671zbMath0729.05021MaRDI QIDQ805627

Brendan D. McKay

Publication date: 1990

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02128671

zbMATH Keywords

Eulerian digraphs; regular tournaments; Eulerian oriented digraphs

Mathematics Subject Classification ID

05C20: Directed graphs (digraphs), tournaments

05C45: Eulerian and Hamiltonian graphs

Related Items

Analytic analysis of algorithms, Asymptotic behavior of the number of Eulerian orientations of graphs, Packing edge-disjoint triangles in regular and almost regular tournaments, Multiplayer rock-paper-scissors, An upper bound for the number of Eulerian orientations of a regular graph, Analytic methods in asymptotic enumeration, A random walk approach to linear statistics in random tournament ensembles, Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence, Asymptotic enumeration of dense 0-1 matrices with specified line sums, Effective scalar products of D-finite symmetric functions, Packing Triangles in Regular Tournaments, Subgraphs of Dense Random Graphs with Specified Degrees, Random dense bipartite graphs and directed graphs with specified degrees, A Dirac-Type Result on Hamilton Cycles in Oriented Graphs

Cites Work

• Asymptotic enumeration by degree sequence of graphs of high degree
• Random regular tournaments
• Asymptotic enumeration of tournaments with a given score sequence
• Unnamed Item