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

DOI10.1002/(SICI)1098-2418(200001)16:1%3C47::AID-RSA4%3E3.0.CO;2-LMaRDI QIDQ4943353zbMATH OpenOpenAlexFDO

Authors Brendan D. McKay, Xiaoji Wang, Zhicheng Gao

Publication date 18 November 2001

Full work available at URL https://doi.org/10.1002/(sici)1098-2418(200001)16:1%3C47::aid-rsa4%3E3.0.co;2-l

zbMATH Keywords

automorphism grouprandom tournament

Mathematics Subject Classification ID

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

Recommendations

• Asymptotic enumeration of tournaments with a given score sequence
• On the asymptotic distributions of subgraph counts in a random tournament
• The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
• scientific article; zbMATH DE number 7732125
• On the evolution of a random tournament

Cites work

• Asymptotic enumeration by degree sequence of graphs of high degree

Cited in

(11)

• The asymmetry number of finite tournaments, and some related results
• Asymptotic enumeration of tournaments with a given score sequence
• Random sampling of labeled tournaments
• 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
• Random dense bipartite graphs and directed graphs with specified degrees
• Embedding tournaments
• Asymptotic enumeration of difference matrices over cyclic groups
• On the asymptotic distributions of subgraph counts in a random tournament
• Uniform sampling of k-hypertournaments
• Largest digraphs contained in all n-tournaments

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943353)