On the Hamilton-Waterloo problem with triangle factors and C₃x-factors

MaRDI QIDQ2800799zbMATH OpenFDO

Authors John Asplund, David Kamin, Adrián Pastine, Sibel Özkan, Melissa S. Keranen

Publication date 18 April 2016

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

Full work available at URL https://arxiv.org/abs/1510.04607, http://ajc.maths.uq.edu.au//pdf/64/ajc_v64_p458.pdf

zbMATH Keywords

Oberwolfach problem

Mathematics Subject Classification ID

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

Abstract: The Hamilton-Waterloo Problem (HWP) in the case of $C_m$-factors and $C_n$-factors asks if $K_v$, where $v$ is odd (or $K_v-F$, where $F$ is a 1-factor and $v$ is even), can be decomposed into r copies of a 2-factor made either entirely of $m$-cycles and $s$ copies of a 2-factor made entirely of $n$-cycles. In this paper, we give some general constructions for such decompositions and apply them to the case where $m=3$ and $n=3x$. We settle the problem for odd $v$, except for a finite number of $x$ values. When $v$ is even, we make significant progress on the problem, although open cases are left. In particular, the difficult case of $v$ even and $s=1$ is left open for many situations.

Recommendations

• The Hamilton-Waterloo Problem for C3-Factors and Cn-Factors
• The Hamilton-Waterloo problem with triangle-factors and Hamilton cycles: the case \(n\equiv 3\pmod{18}\)
• On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity
• The Hamilton-Waterloo problem for Hamilton cycles and triangle-factors
• The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle

Cited in

(17)

• On the generalized Oberwolfach problem
• A survey on constructive methods for the Oberwolfach problem and its variants
• Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment
• A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors
• The Hamilton-Waterloo problem with even cycle lengths
• Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem
• On the minisymposium problem
• scientific article; zbMATH DE number 7641237 (Why is no real title available?)
• Completing the spectrum of almost resolvable cycle systems with odd cycle length
• On the Hamilton-Waterloo problem with cycle lengths of distinct parities
• The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
• The Hamilton-Waterloo Problem for C3-Factors and Cn-Factors
• On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity
• The Hamilton-Waterloo problem for Hamilton cycles and triangle-factors
• The Hamilton-Waterloo problem with triangle-factors and Hamilton cycles: the case \(n\equiv 3\pmod{18}\)
• A generalization of the Hamilton-Waterloo problem on complete equipartite graphs
• Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem

This page was built for publication: On the Hamilton-Waterloo problem with triangle factors and \(C_{3x}\)-factors

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