Scheduling a tournament

Jeffrey H. Dinitz, Dalibor Froncek, Esther R. Lamken, Walter D. Wallis

Research output: Chapter in Book/Report/Conference proceedingChapter

18 Scopus citations

Abstract

At any stage, let G be the underlying graph of the union of the rounds already held. In order for the tournament to continue, the complement of G must contain a 1-factor; in other words, the set of factors chosen so far must not be premature (see [1825]). In practice a limit of approximately log2 n rounds is used for n teams.

Original languageEnglish (US)
Title of host publicationHandbook of Combinatorial Designs, Second Edition
PublisherCRC Press
Pages591-606
Number of pages16
ISBN (Electronic)9781420010541
ISBN (Print)9781584885061
StatePublished - Jan 1 2006
Externally publishedYes

Fingerprint Dive into the research topics of 'Scheduling a tournament'. Together they form a unique fingerprint.

Cite this