Upsets in Round Robin Tournaments
From MaRDI portal
Publication:5507531
DOI10.4153/CJM-1965-091-7zbMath0135.01304OpenAlexW2017839670MaRDI QIDQ5507531
Publication date: 1965
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1965-091-7
Related Items
A survey on the linear ordering problem for weighted or unweighted tournaments, Tournaments, oriented graphs and football sequences, On linear programming duality and Landau's characterization of tournament, On \(k\)-hypertournament matrices, Construction of all tournament matrices with prescribed row sum vector, Unnamed Item, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Transitive partitions in realizations of tournament score sequences, Score sequences of oriented graphs, Ranking tournaments with no errors. I: Structural description, The number of tournaments with the minimum number of upsets, 2-partition-transitive tournaments, Measuring intransitivity, Upsets in round robin tournaments
