Abstract
A Hamilton path tournament design involving n teams and n/2 stadiums, is a round robin schedule on n - 1 days in which each team plays in each stadium at most twice, and the set of games played in each stadium induce a Hamilton path on n teams. Previously, Hamilton path tournament designs were shown to exist for all even n not divisible by 4, 6, or 10. Here, we give an inductive procedure for the construction of Hamilton path tournament designs for n = 2p ≥ 8 teams.
| Original language | English |
|---|---|
| Pages (from-to) | 703-711 |
| Number of pages | 9 |
| Journal | Graphs and Combinatorics |
| Volume | 27 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 2011 Sep |
Fingerprint
Keywords
- 1-Factor
- Balanced tournament design
- Hamilton path
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Theoretical Computer Science
Cite this
Construction of Hamilton Path Tournament Designs. / Ikebe, Yoshiko T.; Tamura, Akihisa.
In: Graphs and Combinatorics, Vol. 27, No. 5, 09.2011, p. 703-711.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Construction of Hamilton Path Tournament Designs
AU - Ikebe, Yoshiko T.
AU - Tamura, Akihisa
PY - 2011/9
Y1 - 2011/9
N2 - A Hamilton path tournament design involving n teams and n/2 stadiums, is a round robin schedule on n - 1 days in which each team plays in each stadium at most twice, and the set of games played in each stadium induce a Hamilton path on n teams. Previously, Hamilton path tournament designs were shown to exist for all even n not divisible by 4, 6, or 10. Here, we give an inductive procedure for the construction of Hamilton path tournament designs for n = 2p ≥ 8 teams.
AB - A Hamilton path tournament design involving n teams and n/2 stadiums, is a round robin schedule on n - 1 days in which each team plays in each stadium at most twice, and the set of games played in each stadium induce a Hamilton path on n teams. Previously, Hamilton path tournament designs were shown to exist for all even n not divisible by 4, 6, or 10. Here, we give an inductive procedure for the construction of Hamilton path tournament designs for n = 2p ≥ 8 teams.
KW - 1-Factor
KW - Balanced tournament design
KW - Hamilton path
UR - http://www.scopus.com/inward/record.url?scp=80051546325&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80051546325&partnerID=8YFLogxK
U2 - 10.1007/s00373-010-0998-6
DO - 10.1007/s00373-010-0998-6
M3 - Article
AN - SCOPUS:80051546325
VL - 27
SP - 703
EP - 711
JO - Graphs and Combinatorics
JF - Graphs and Combinatorics
SN - 0911-0119
IS - 5
ER -