Alspach's problem: The case of Hamilton cycles and 5-cycles

MaRDI QIDQ540075zbMATH OpenFDO

Authors Heather Jordon

Publication date 1 June 2011

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/224550, http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p82.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

Summary: 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 \geq 5\) and all nonnegative integers \(h\) and \(t\) with \(hn + 5t = n(n - 1)/2\), the complete graph \(K_n\) decomposes into \(h\) Hamilton cycles and \(t\) 5-cycles and for all even integers \(n \geq 6\) and all nonnegative integers \(h\) and \(t\) with \(hn + 5t = n(n - 2)/2\), the complete graph \(K_n\) 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.

Recommendations

• Cycle decompositions. V: Complete graphs into cycles of arbitrary lengths
• On Alspach's conjecture with two even cycle lengths
• Cycle decompositions of complete graphs
• Decomposing the complete graph into cycles of many lengths
• On Alspach's conjecture

Cited in

(1)

• On Alspach's conjecture

This page was built for publication: Alspach's problem: The case of Hamilton cycles and 5-cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540075)