aDepartment of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;bDepartment of Applied Mathematics, University Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands
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.