Decomposing the cube into paths

From MaRDI portal




Abstract: We consider the question of when the n-dimensional hypercube can be decomposed into paths of length k. Mollard and Ramras cite{MR2013} noted that for odd n it is necessary that k divides n2n1 and that kleqn. Later, Anick and Ramras cite{AR2013} showed that these two conditions are also sufficient for odd nleq232 and conjectured that this was true for all odd n. In this note we prove the conjecture.









This page was built for publication: Decomposing the cube into paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q740656)