Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem

DOI10.1016/J.JCTA.2023.105803MaRDI QIDQ6071955zbMATH OpenFDO

Authors Andrea Burgess, Peter Danziger, Adrián Pastine, Tommaso Traetta

Publication date 29 November 2023

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2209.11137

zbMATH Keywords

2-factorizationscycle systemsgeneralized Oberwolfach problemHamilton-Waterloo problemresolvable cycle decompositionsrow-sum matrices

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: In this paper, we formally introduce the concept of a row-sum matrix over an arbitrary group $G$. When $G$ is cyclic, these types of matrices have been widely used to build uniform 2-factorizations of small Cayley graphs (or, Cayley subgraphs of blown-up cycles), which themselves factorize complete (equipartite) graphs. Here, we construct row-sum matrices over a class of non-abelian groups, the generalized dihedral groups, and we use them to construct uniform $2$-factorizations that solve infinitely many open cases of the Hamilton-Waterloo problem, thus filling up large parts of the gaps in the spectrum of orders for which such factorizations are known to exist.

Recommendations

• The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors
• The Hamilton-Waterloo problem with even cycle lengths
• A generalization of the Hamilton-Waterloo problem on complete equipartite graphs
• On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity

Cites work

• A Combinatorial Problem on Abelian Groups
• A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors
• Complete mappings of finite groups
• scientific article; zbMATH DE number 1394637 (Why is no real title available?)
• scientific article; zbMATH DE number 3392464 (Why is no real title available?)
• Octahedral, dicyclic and special linear solutions of some Hamilton-Waterloo problems
• On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
• On the generalized Oberwolfach problem
• On the Hamilton-Waterloo problem for bipartite 2-factors
• On the Hamilton-Waterloo problem with cycle lengths of distinct parities
• On the Hamilton-Waterloo problem with odd cycle lengths
• On the Hamilton-Waterloo problem with odd orders
• On the Hamilton-Waterloo problem with triangle factors and \(C_{3x}\)-factors
• On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity
• On the Oberwolfach problem for single-flip 2-factors via graceful labelings
• Some observations on the oberwolfach problem
• The CRC handbook of combinatorial designs
• The equipartite Oberwolfach problem with uniform tables
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• The Hamilton-Waterloo Problem for C3-Factors and Cn-Factors
• The Hamilton-Waterloo problem for cycle sizes 3 and 4
• The Hamilton-Waterloo problem for Hamilton cycles and triangle-factors
• The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles
• The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors
• The Hamilton-Waterloo problem with even cycle lengths
• The Oberwolfach problem and factors of uniform odd length cycles

Cited in

(2)

• The directed uniform Hamilton-Waterloo problem involving even cycle sizes
• On the Hamilton-Waterloo problem with a single factor of 6-cycles

This page was built for publication: Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem

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