Computation of the Number of Score Sequences in Round-Robin Tournaments
From MaRDI portal
Publication:5736664
DOI10.4153/CMB-1964-015-1zbMath0123.37702OpenAlexW2320232555MaRDI QIDQ5736664
Publication date: 1964
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cmb-1964-015-1
Related Items
Counting tournament score sequences ⋮ An algorithm to generate tournament score sequences ⋮ Unnamed Item ⋮ An algorithm for generating partitions and its applications ⋮ Condition for a tournament score sequence to be simple ⋮ Some asymptotic formulas for lattice paths ⋮ Ranking players in multiple tournaments ⋮ On the asymptotic number of tournament score sequences