Almost partitioning the hypercube into copies of a graph

Vytautas Gruslys, Shoham Letzter

Published 2016-12-14Version 1

Let $H$ be an induced subgraph of the hypercube $Q_k$, for some $k$. We show that for some $c = c(H)$, the vertices of $Q_n$ can be partitioned into induced copies of $H$ and a remainder of at most $O(n^c)$ vertices. We also show that the error term cannot be replaced by anything smaller than $\log n$.