2000 character limit reached
Decompositions of $n$-Cube into $2^mn$-Cycles
Published 4 Apr 2018 in math.CO | (1804.01243v1)
Abstract: It is known that the $n$-dimensional hypercube $Q_n,$ for $n$ even, has a decomposition into $k$-cycles for $k=n, 2n,$ $2l$ with $2 \leq l \leq n.$ In this paper, we prove that $Q_n$ has a decomposition into $2mn$-cycles for $n \geq 2m.$ As an immediate consequence of this result, we get path decompositions of $Q_n$ 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.