Round Robin Tournaments with One Bye and No Breaks in Home-Away Patterns Are Unique

Dalibor Fronček () and Mariusz Meszka ()
Additional contact information
Dalibor Fronček: University of Minnesota Duluth
Mariusz Meszka: AGH University of Science and Technology

A chapter in Multidisciplinary Scheduling: Theory and Applications, 2005, pp 331-340 from Springer

Abstract: Abstract We examine round robin tournaments with m teams and m rounds, for m ≥ 3, with the property that every team plays no game in one round and exactly one game in each of the remaining m − 1 rounds. We show that for every such m there exists a unique schedule in which no team plays two consecutive home or away games.

Keywords: scheduling tournaments; round robin tournament; home-away pattern; complete graph factorization (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-27744-8_16

Ordering information: This item can be ordered from
http://www.springer.com/9780387277448

DOI: 10.1007/0-387-27744-7_16

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().