Tight bounds for break minimization in tournament scheduling

Andries E. Brouwer, Gerhard F. Post, Gerhard Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

5 Citations (Scopus)
93 Downloads (Pure)


We consider round-robin sports tournaments with $n$ teams and $n-1$ rounds. We construct an infinite family of opponent schedules for which every home-away assignment induces at least $n(n-2)/4$ breaks. This construction establishes a matching lower bound for a corresponding upper bound from the literature.
Original languageEnglish
Pages (from-to)1065-1068
Number of pages4
JournalJournal of combinatorial theory. Series A
Issue numberSupplement/6
Publication statusPublished - 2008


  • break minimization
  • Sports scheduling
  • sports tournament
  • Latin squares


Dive into the research topics of 'Tight bounds for break minimization in tournament scheduling'. Together they form a unique fingerprint.

Cite this