On round-robin tournaments with a unique maximum score

zbMATH Open1542.05068MaRDI QIDQ6562418

Yaakov Malinovsky, J. W. Moon

Publication date: 26 June 2024

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

random labelled graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the chromatic index of almost all graphs
• Die Berechnung der Turnier-Ergebnisse als ein Maximumproblem der Wahrscheinlichkeitsrechnung.
• On negative dependence inequalities and maximal scores in round-robin tournaments
• To stay discovered: on tournament mean score sequences and the Bradley-Terry model
• Random graphs.
• The probabilistic method
• Introduction to Random Graphs
• TOURNAMENTS AND PAIRED COMPARISONS
• A Remark on a Paper of Trawinski and David Entitled: "Selection of the Best Treatment in a paired-Comparison Experiment"
• Annotated readings in the history of statistics
• On Tournaments and negative dependence

This page was built for publication: On round-robin tournaments with a unique maximum score