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.
|Number of pages||4|
|Journal||Journal of combinatorial theory. Series A|
|Publication status||Published - 2008|
- break minimization
- Sports scheduling
- sports tournament
- Latin squares