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.
展开▼
机译：涉及n个球队和n / 2个体育场的汉密尔顿路径锦标赛设计是一种在n − 1天的循环赛时间表，其中每个团队最多在每个体育场玩两次，并且在每个体育场进行的一组游戏在汉诺威路径上产生汉密尔顿路径n个团队。以前，汉密尔顿路径锦标赛的设计被证明存在于所有甚至不能被4、6或10整除的n上。这里，我们给出了n = 2 p ≥8支队伍。
展开▼
