Asymptotic enumeration of tournaments with a given score sequence

DOI10.1006/jcta.1996.0003zbMath0842.05042OpenAlexW2007774136MaRDI QIDQ1906120

Xiaoji Wang, Brendan D. McKay

Publication date: 26 February 1996

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/705db8c2f18c72cb8fe47a3d4f94c1bd05c246ee

zbMATH Keywords

random tournamentsscore sequenceenumeration of tournamentslabeled tournaments

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

Subgraphs of Dense Random Graphs with Specified Degrees ⋮ Asymptotic enumeration of dense 0-1 matrices with specified line sums ⋮ Uniform sampling ofk-hypertournaments ⋮ A random walk approach to linear statistics in random tournament ensembles ⋮ Random dense bipartite graphs and directed graphs with specified degrees ⋮ Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence ⋮ The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs

This page was built for publication: Asymptotic enumeration of tournaments with a given score sequence