Decompositions of $n$-Cube into $2^mn$-Cycles
S. A. Tapadia, B. N. Waphare, and Y. M. Borse

TL;DR
This paper proves that hypercubes can be decomposed into specific large cycles, extending known results and partially solving conjectures related to cycle decompositions in hypercubes.
Contribution
It establishes that hypercubes have decompositions into $2^mn$-cycles for $n geq 2^m$, advancing understanding of cycle structures in hypercubes.
Findings
Decomposition of $Q_n$ into $2^mn$-cycles for $n geq 2^m$
Path decompositions of hypercubes derived from cycle decompositions
Partial solutions to conjectures by Ramras and Erde
Abstract
It is known that the -dimensional hypercube for even, has a decomposition into -cycles for with In this paper, we prove that has a decomposition into -cycles for As an immediate consequence of this result, we get path decompositions of as well. This gives a partial solution to a conjecture posed by Ramras and also, it solves some special cases of a conjecture due to Erde.
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
TopicsInterconnection Networks and Systems · graph theory and CDMA systems · Advanced Graph Theory Research
