| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656407 | Journal of Combinatorial Theory, Series A | 2008 | 4 Pages |
Abstract
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 breaks. This construction establishes a matching lower bound for a corresponding upper bound from the literature.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
