Decomposing the vertex set of a hypercube into isomorphic subgraphs
Combinatorics
2016-11-08 v1
Abstract
Let be an induced subgraph of the hypercube for some . We show that if is a power of then, for sufficiciently large , the vertex set of can be partitioned into induced copies of . This answers a question of Offner. In fact, we prove a stronger statement: if is a subset of for some and if is a power of , then, for sufficiently large , can be partitioned into isometric copies of .
Keywords
Cite
@article{arxiv.1611.02021,
title = {Decomposing the vertex set of a hypercube into isomorphic subgraphs},
author = {Vytautas Gruslys},
journal= {arXiv preprint arXiv:1611.02021},
year = {2016}
}
Comments
10 pages