Construction of Hamilton Path Tournament Designs

Yoshiko T. Ikebe, Akihisa Tamura

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)703-711
Number of pages9
JournalGraphs and Combinatorics
Volume27
Issue number5
DOIs
Publication statusPublished - 2011 Sep

Fingerprint

Hamilton Path
Stadiums
Tournament
Divisible
Schedule
Game
Design

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 journalArticle

Ikebe, Yoshiko T. ; Tamura, Akihisa. / Construction of Hamilton Path Tournament Designs. In: Graphs and Combinatorics. 2011 ; Vol. 27, No. 5. pp. 703-711.
@article{847e3487e4894497819d9c82e8f272be,
title = "Construction of Hamilton Path Tournament Designs",
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.",
keywords = "1-Factor, Balanced tournament design, Hamilton path",
author = "Ikebe, {Yoshiko T.} and Akihisa Tamura",
year = "2011",
month = "9",
doi = "10.1007/s00373-010-0998-6",
language = "English",
volume = "27",
pages = "703--711",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "5",

}

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 -