On the asymptotic distributions of subgraph counts in a random tournament

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199810/12)13:3/4<249::AID-RSA4>3.0.CO;2-V" /><249::AID-RSA4>3.0.CO;2-V 10.1002/(SICI)1098-2418(199810/12)13:3/4<249::AID-RSA4>3.0.CO;2-VzbMath0959.05107OpenAlexW2056095602MaRDI QIDQ4705335

Pontus Andersson

Publication date: 19 December 1999

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199810/12)13:3/4<249::aid-rsa4>3.0.co;2-v

zbMATH Keywords

asymptotic distributiondigraphrandom tournament

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Tournaments and even graphs are equinumerous ⋮ Small variance of subgraph counts in a random tournament

This page was built for publication: On the asymptotic distributions of subgraph counts in a random tournament