Constructing fair round robin tournaments with a minimum number of breaks

Research output: Contribution to journalArticleAcademicpeer-review

18 Citations (Scopus)


Given n clubs with two teams each, we show that, if n is even, it is possible to construct a schedule for a single round robin tournament satisfying the following properties: the number of breaks is 2n−2, teams of the same club never play at home simultaneously, and they play against each other in the first round. We also consider a fairness constraint related to different playing strengths of teams competing in the tournament.
Original languageEnglish
Pages (from-to)592-596
Number of pages5
JournalOperations research letters
Issue number6
Publication statusPublished - Nov 2010


  • Round-robin tournaments
  • Sports
  • Break
  • Strength group


Dive into the research topics of 'Constructing fair round robin tournaments with a minimum number of breaks'. Together they form a unique fingerprint.

Cite this