Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(200001)16:1<47::AID-RSA4>3.0.CO;2-L" /><47::AID-RSA4>3.0.CO;2-L 10.1002/(SICI)1098-2418(200001)16:1<47::AID-RSA4>3.0.CO;2-LzbMath0972.05002OpenAlexW1982971399MaRDI QIDQ4943353

Brendan D. McKay, Xiaoji Wang, Zhi-Cheng Gao

Publication date: 18 November 2001

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(200001)16:1<47::aid-rsa4>3.0.co;2-l

zbMATH Keywords

automorphism grouprandom tournament

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Asymptotic enumeration (05A16) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Asymptotic Enumeration of Difference Matrices over Cyclic Groups ⋮ 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

Cites Work

• Asymptotic enumeration by degree sequence of graphs of high degree

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