Location of Repository

Alspach’s Problem: The Case of Hamilton Cycles and 5-Cycles

By Heather Jordon

Abstract

In this paper, we settle Alspach’s problem in the case of Hamilton cycles and 5-cycles; that is, we show that for all odd integers n ≥ 5 and all nonnegative integers h and t with hn + 5t = n(n − 1)/2, the complete graph Kn decomposes into h Hamilton cycles and t 5-cycles and for all even integers n ≥ 6 and all nonnegative integers h and t with hn+5t = n(n −2)/2, the complete graph Kn decomposes into h Hamilton cycles, t 5-cycles, and a 1-factor. We also settle Alspach’s problem in the case of Hamilton cycles and 4-cycles.

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.372.8917
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.combinatorics.org/o... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.