arXiv Analytics

Sign in

arXiv:1611.02021 [math.CO]AbstractReferencesReviewsResources

Decomposing the vertex set of a hypercube into isomorphic subgraphs

Vytautas Gruslys

Published 2016-11-07Version 1

Let $G$ be an induced subgraph of the hypercube $Q_k$ for some $k$. We show that if $|G|$ is a power of $2$ then, for sufficiciently large $n$, the vertex set of $Q_n$ can be partitioned into induced copies of $G$. This answers a question of Offner. In fact, we prove a stronger statement: if $X$ is a subset of $\{0,1\}^k$ for some $k$ and if $|X|$ is a power of $2$, then, for sufficiently large $n$, $\{0,1\}^n$ can be partitioned into isometric copies of $X$.

Comments: 10 pages
Categories: math.CO
Subjects: 05C51, 05B45
Related articles: Most relevant | Search more
arXiv:1310.6776 [math.CO] (Published 2013-10-24)
Decomposing the cube into paths
arXiv:1710.07255 [math.CO] (Published 2017-10-19)
Partitioning the vertices of a torus into isomorphic subgraphs
arXiv:1006.3049 [math.CO] (Published 2010-06-15, updated 2015-03-20)
Long paths and cycles in subgraphs of the cube