Decomposing the vertex set of a hypercube into isomorphic subgraphs
Abstract
Let G be an induced subgraph of the hypercube Qk for some k. We show that if |G| is a power of 2 then, for sufficiciently large n, the vertex set of Qn 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.
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.