Scheduling a tournament

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

Scheduling a tournament

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

Research output: Chapter in Book/Report/Conference proceeding › Chapter

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 log₂ n rounds is used for n teams.

Original language	English (US)
Title of host publication	Handbook of Combinatorial Designs, Second Edition
Publisher	CRC Press
Pages	591-606
Number of pages	16
ISBN (Electronic)	9781420010541
ISBN (Print)	9781584885061
State	Published - Jan 1 2006
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2007 by Taylor & Francis Group, LLC.

Find It

Find It at U of M Libraries

Cite this

@inbook{c66b4a4ef18c4579b004cb011554aa11,

title = "Scheduling a tournament",

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.",

author = "Dinitz, {Jeffrey H.} and Dalibor Froncek and Lamken, {Esther R.} and Wallis, {Walter D.}",

note = "Publisher Copyright: {\textcopyright} 2007 by Taylor & Francis Group, LLC.",

year = "2006",

month = jan,

day = "1",

language = "English (US)",

isbn = "9781584885061",

pages = "591--606",

booktitle = "Handbook of Combinatorial Designs, Second Edition",

publisher = "CRC Press",

}

TY - CHAP

T1 - Scheduling a tournament

AU - Dinitz, Jeffrey H.

AU - Froncek, Dalibor

AU - Lamken, Esther R.

AU - Wallis, Walter D.

PY - 2006/1/1

Y1 - 2006/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84976362403&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84976362403&partnerID=8YFLogxK

M3 - Chapter

AN - SCOPUS:84976362403

SN - 9781584885061

SP - 591

EP - 606

BT - Handbook of Combinatorial Designs, Second Edition

PB - CRC Press

ER -

Scheduling a tournament

Abstract

Bibliographical note

Find It

Other files and links

Fingerprint

Cite this