Tight bounds for break minimization in tournament scheduling

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 1 4 n ( n − 2 ) breaks. This construction establishes a matching lower bound for a corresponding upper bound from the literature.