EEMCS EPrints Service
Brouwer, A.E. and Post, G.F. and Woeginger, G.J. (2007) Tight bounds for break minimization. Memorandum 1836, Department of Applied Mathematics, University of Twente, Enschede. ISSN 1874-4850
There is a more recent version of this eprint available. Click here to view it.
Full text available as:
Official URL: http://www.math.utwente.nl/publications
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.
Available Versions of this Item
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item