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

DOI10.1007/BF02128671zbMath0729.05021OpenAlexW1991825372MaRDI 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 digraphsregular tournamentsEulerian oriented digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (14)

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

Cites Work

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

This page was built for publication: The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs