Round-Robin Tournaments with homogenous rounds

Share/Save/Bookmark

Buiteveld, Bregje and Holland, Erik van and Post, Gerhard and Smit, Dirk (2010) Round-Robin Tournaments with homogenous rounds. In: 8th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2010, 10-13 Aug 2010, Belfast, Northern Ireland (pp. pp. 122-135).

open access
[img] PDF
21MB
Abstract:We study 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 the tournament each match between two teams is either played once or twice, in the latter case 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. Of these 149 cases a tournament can be constructed in 147 cases. 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:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/75074
Official URL:http://www.cs.qub.ac.uk/~B.McCollum/patat10
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page