Cyclic m-cycle systems of complete graphs minus a 1-factor

2015/11/13 by Heather Jordon, Jordon, Heather, Joy Morris +1
Computer Science · Engineering · Mathematics · #05C25 #05C38 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems #math.CO #msc:05C25 #msc:05C38

paper · pdf · doi:10.48550/arxiv.1511.04409

20 pages

arxiv created 2015/11/13 · openalex publication_date 2015/11/13 · arxiv updated 2015/11/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we provide necessary and sufficient conditions for the existence of a cyclic m-cycle system of K_n-I when m and n are even and m | n.

Related

• Cyclic cycle systems of the complete multipartite graph
• Cyclic hamiltonian cycle systems of the complete multipartite graph: even number of parts
• Some bounds on the number of non isomorphic cyclic k-cycle systems of the complete graph
• On the existence of unparalleled even cycle systems
• Almost resolvable even cycle systems of (K_u × K_g)(λ)