Construction of Hamilton Path Tournament Designs

Yoshiko T. Ikebe, Akihisa Tamura

研究成果: Article査読

抄録

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.

本文言語English
ページ(範囲)703-711
ページ数9
ジャーナルGraphs and Combinatorics
27
5
DOI
出版ステータスPublished - 2011 9 1

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • 離散数学と組合せ数学

フィンガープリント

「Construction of Hamilton Path Tournament Designs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル