Cyclic $m$-cycle systems of complete graphs minus a 1-factor
Heather Jordon, Joy Morris

TL;DR
This paper establishes precise conditions for the existence of cyclic m-cycle decompositions of complete graphs minus a 1-factor, focusing on cases where both m and n are even and m divides n.
Contribution
It provides necessary and sufficient conditions for cyclic m-cycle systems of K_n minus a 1-factor under specific parity and divisibility constraints.
Findings
Necessary and sufficient conditions derived for cyclic m-cycle systems
Conditions specifically for even m and n with m dividing n
Advances understanding of cycle decompositions in complete graphs
Abstract
In this paper, we provide necessary and sufficient conditions for the existence of a cyclic -cycle system of when and are even and .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Finite Group Theory Research · Coding theory and cryptography
