@book{2e9a7c004fba4519b4aabd1b39f7b1fd,

title = "Tight bounds for break minimization",

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

keywords = "IR-67076, sports tournament, EWI-9712, break minimization, Sports scheduling, Latin squares, METIS-241596",

author = "Brouwer, {Andries E.} and Post, {Gerhard F.} and Gerhard Woeginger",

year = "2007",

month = may,

language = "Undefined",

series = "Memorandum / Department of Applied Mathematics",

publisher = "University of Twente",

number = "WP07-01/1836",

address = "Netherlands",

}