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 1

    Fingerprint

Keywords

  • 1-Factor
  • Balanced tournament design
  • Hamilton path

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this