Round-robin tournaments with homogeneous rounds

Share/Save/Bookmark

Buiteveld, Bregje and Holland, Erik van and Post, Gerhard and Smit, Dirk (2011) Round-robin tournaments with homogeneous rounds. Annals of Operations Research . ISSN 0254-5330

[img] PDF
Restricted to UT campus only
: Request a copy
469kB
Abstract:We study single and double round-robin tournaments for n teams, where in each round a fixed number (g) of teams is present and each team present plays a fixed number (m) of matches in this round. In a single, respectively double, round-robin tournament each pair of teams play one, respectively two, matches. In the latter case the two matches should be played in different rounds. We give necessary combinatorial conditions on the triples (n,g,m) for which such round-robin tournaments can exist, and discuss three general construction methods that concern the cases m=1, m=2 and m=g−1. For n≤20 these cases cover 149 of all 173 non-trivial cases that satisfy the necessary conditions. In 147 of these 149 cases a tournament can be constructed. For the remaining 24 cases the tournament does not exist in 2 cases, and is constructed in all other cases. Finally we consider the spreading of rounds for teams, and give some examples where well-spreading is either possible or impossible.
Item Type:Article
Copyright:© 2011 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/79820
Official URL:http://dx.doi.org/10.1007/s10479-011-0981-5
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page