Round-robin tournaments with minimum number of breaks and two teams per club

Share/Save/Bookmark

Hof, Pim van 't and Post, Gerhard and Briskorn, Dirk (2009) Round-robin tournaments with minimum number of breaks and two teams per club. [Report]

open access
[img]
Preview
PDF
118kB
Abstract:We study round-robin tournaments for 2n teams. Here n is either interpreted as the number of clubs, each having two teams, or the number of strength groups with two teams each. For even n we give a construction of a single round-robin tournament for 2n teams with 2n - 2 breaks, where the teams of the same club have complementary home-away patterns and play against each other in the first round. If the pairs of teams are strength groups, then a cyclic permutation of the constructed schedule results in a group-balanced tournament.
Item Type:Report
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/68537
Official URL:http://www.bwl.uni-kiel.de/bwlinstitute/Prod/team/briskorn/TwoTeamsPerClub2009.pdf
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 264157