Decompositions of n-Cube into 2mn-Cycles
Abstract
It is known that the n-dimensional hypercube Qn, for n even, has a decomposition into k-cycles for k=n, 2n, 2l with 2 ≤ l ≤ n. In this paper, we prove that Qn has a decomposition into 2mn-cycles for n ≥ 2m. As an immediate consequence of this result, we get path decompositions of Qn 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.