Decompositions of even hypercubes into cycles whose length is a power of two
Samuel Gibson, David Offner

TL;DR
This paper demonstrates that even-dimensional hypercubes can be decomposed into edge-disjoint cycles of lengths that are powers of two, covering all such cycle lengths from 4 up to 2^n.
Contribution
It provides a comprehensive decomposition of even hypercubes into cycles of specific power-of-two lengths, extending previous understanding of hypercube cycle structures.
Findings
Hypercubes can be decomposed into cycles of length 2^i for all i from 2 to n.
The decomposition covers all such cycle lengths within the specified range.
This advances the understanding of hypercube cycle decompositions.
Abstract
If is even, the -dimensional hypercube can be decomposed into edge-disjoint cycles of length for every value of from to .
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 · Advanced Graph Theory Research · graph theory and CDMA systems
