A short proof of a variant of the round-robin scheduling problem
Chris Busenhart
ETH Zurich, Zürich, SwitzerlandChristoph Leuenberger
Université de Fribourg, Fribourg, SwitzerlandMicha Wasem
HTA Freiburg, HES-SO University of Applied Science and Arts Western Switzerland, Fribourg, Switzerland; UniDistance Suisse, Brig, SwitzerlandWilliam Xu
ETH Zurich, Zürich, Switzerland
![A short proof of a variant of the round-robin scheduling problem cover](/_next/image?url=https%3A%2F%2Fcontent.ems.press%2Fassets%2Fpublic%2Fimages%2Fserials%2Fcover-em.png&w=3840&q=90)
Abstract
Suppose people participate in a sports tournament that consists of multiple rounds. In each round, two teams of people are formed to play against each other. We require that every two players play at least once in opposing teams and once in the same team. For this variant of the round-robin scheduling problem, an explicit formula for the minimum number of rounds needed to satisfy both conditions has recently been published. In this short note, an alternative and short proof of this is given.
Cite this article
Chris Busenhart, Christoph Leuenberger, Micha Wasem, William Xu, A short proof of a variant of the round-robin scheduling problem. Elem. Math. (2024), published online first
DOI 10.4171/EM/536