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

2017/06/16 by L. Wang, Liuping Wang, H. Cao +2 · 1 citation
Computer Science · Mathematics · #Advanced Differential Equations and Dynamical Systems #Algorithms and Data Compression #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.1706.05958

k-cycle system; almost resolvable cycle system. arXiv admin note: substantial text overlap with arXiv:1605.00818

openalex publication_date 2017/06/16 · openalex created_date 2017/06/30 · arxiv created 2017/08/31 · arxiv updated 2017/09/01 · openalex updated_date 2026/07/28

Abstract

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

Cited by

• Almost resolvable k-cycle systems with k≡ 2\pmod 4

Related

• Almost resolvable k-cycle systems with k≡ 2\pmod 4
• Almost resolvable even cycle systems of (K_u × K_g)(λ)
• A solution to Erdős and Hajnal's odd cycle problem
• Doyen-Wilson results for odd length cycle systems
• Almost 2-perfect 8-cycle systems