Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks

Constructing fair round robin tournament

Constructing fair round robin tournaments with a minimum number of breaks

✍ Pim van ’t Hof; Gerhard Post; Dirk Briskorn 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 228 KB

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