Almost partitioning the hypercube into copies of a graph

Vytautas Gruslys; Shoham Letzter

Almost partitioning the hypercube into copies of a graph

Combinatorics 2016-12-15 v1

Authors: Vytautas Gruslys , Shoham Letzter

Abstract

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$ .

Keywords

graph theory partition theory

Cite

@article{arxiv.1612.04603,
  title  = {Almost partitioning the hypercube into copies of a graph},
  author = {Vytautas Gruslys and Shoham Letzter},
  journal= {arXiv preprint arXiv:1612.04603},
  year   = {2016}
}

Comments

13 pages, 1 figure

Related papers

View all related →