On the evolution of a random tournament

DOI10.1016/0012-365X(94)00279-RzbMath0842.05081OpenAlexW2114498279MaRDI QIDQ1910560

Jacek Gruszka, Tomasz Łuczak, Andrzej Ruciński

Publication date: 24 March 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00279-r

zbMATH Keywords

threshold functionsrandom tournament

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items

The localization game on oriented graphs, Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs, Hamilton cycles in a random tournament, Robust bounds on choosing from large tournaments, Robust bounds on choosing from large tournaments

Cites Work

• Almost all Tournaments are Irreducible
• Stochastic Competition Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item