The Hamilton-Waterloo problem on wreath product graph C_m \wr K₁₆

2021/02/24 by L. Wang, H. Cao, Wang, L. +1
Biochemistry, Genetics and Molecular Biology · Engineering · Mathematics · #Algorithm #Combinatorics #Combinatorics (math.CO) #Complete graph #FOS: Mathematics #Factorization #Finite Group Theory Research #Geometry #Graph #Mathematics #Product (mathematics) #Ubiquitin and proteasome pathways #Wreath product #graph theory and CDMA systems #math.CO

paper · pdf · doi:10.48550/arxiv.2102.12063

arxiv created 2021/02/24 · openalex publication_date 2021/02/24 · arxiv updated 2021/02/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06

Abstract

The Hamilton-Waterloo problem is a problem of graph factorization. The Hamilton-Waterloo problem HWP(H;m,n;α,β) asks for a 2-factorization of H containing α C_m-factors and β C_n-factors. In this paper, we almost completely solve the Hamilton-Waterloo problem on wreath product graph C_m \wr K₁₆ with C₁₆-factors and C_m-factors for an odd integer m.

Related

• The Hamilton-Waterloo Problem with C₄ and C_m Factors
• On the Hamilton-Waterloo Problem with odd orders
• On the Hamilton-Waterloo Problem with a single factor of 6-cycles
• The Hamilton-Waterloo Problem with even cycle lengths
• On the Hamilton-Waterloo Problem with cycle lengths of distinct parities