JournalsemOnline First

A short proof of a variant of the round-robin scheduling problem

  • Chris Busenhart

    ETH Zurich, Zürich, Switzerland

  • Christoph Leuenberger

    Université de Fribourg, Fribourg, Switzerland

  • Micha Wasem

    HTA Freiburg, HES-SO University of Applied Science and Arts Western Switzerland, Fribourg, Switzerland; UniDistance Suisse, Brig, Switzerland

  • William Xu

    ETH Zurich, Zürich, Switzerland
A short proof of a variant of the round-robin scheduling problem cover

A subscription is required to access this article.

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