Construction of Hamilton Path Tournament Designs |
| |
Authors: | Yoshiko T Ikebe Akihisa Tamura |
| |
Institution: | 1. Department of Management Science, Tokyo University of Science, Tokyo, 162-8601, Japan 2. Department of Mathematics, Keio University, Kanagawa, 223-8255, Japan
|
| |
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 = 2
p
≥ 8 teams. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|