Completing the spectrum of almost resolvable cycle systems with odd cycle length

DOI10.1016/J.DISC.2017.10.013MaRDI QIDQ1709552zbMATHOpenAlexFDO

Authors H. Cao, Li Wang

Publication date 5 April 2018

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Hamilton-Waterloo problemcycle systemalmost resolvable cycle system

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38)

Abstract: In this paper, we construct almost resolvable cycle systems of order $4k+1$ for odd $kge11$. This completes the proof of the existence of almost resolvable cycle systems with odd cycle length.

Recommendations

• Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem
• Almost resolvable k‐cycle systems with
• Almost resolvable cycle systems --an analogue of Hanani triple systems
• The generalized almost resolvable cycle system problem
• Almost resolvable 4-cycle systems

Cites work

• scientific article; zbMATH DE number 5976587 (Why is no real title available?)
• scientific article; zbMATH DE number 1394637 (Why is no real title available?)
• A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv
• A cyclic solution for an infinite class of Hamilton-Waterloo problems
• A generalization of the Hamilton-Waterloo problem on complete equipartite graphs
• A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors
• Almost resolvable 4-cycle systems
• Almost resolvable cycle systems --an analogue of Hanani triple systems
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• Hanani triple systems
• Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
• More results on cycle frames and almost resolvable cycle systems
• Octahedral, dicyclic and special linear solutions of some Hamilton-Waterloo problems
• On the Hamilton-Waterloo problem with odd orders
• On the Hamilton-Waterloo problem with triangle factors and \(C_{3x}\)-factors
• On the existence of cycle frames and almost resolvable cycle systems
• Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
• Some observations on the oberwolfach problem
• The Hamilton-Waterloo Problem for C3-Factors and Cn-Factors
• The Hamilton-Waterloo problem for triangle-factors and heptagon-factors
• The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors
• The Oberwolfach problem and factors of uniform odd length cycles
• The equipartite Oberwolfach problem with uniform tables
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• The generalized almost resolvable cycle system problem
• The solution of the bipartite analogue of the Oberwolfach problem
• Two new direct product‐type constructions for resolvable group‐divisible designs

Cited in

(9)

• Almost resolvable cycle systems --an analogue of Hanani triple systems
• More results on cycle frames and almost resolvable cycle systems
• Generalized almost resolvable 26-cycle systems
• On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\)
• The generalized almost resolvable cycle system problem
• On the existence of cycle frames and almost resolvable cycle systems
• Factorizations of complete graphs into cycles and 1-factors
• Almost resolvable 4-cycle systems
• On equitably 2-colourable odd cycle decompositions

This page was built for publication: Completing the spectrum of almost resolvable cycle systems with odd cycle length

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