{
  "id": "1612.04603",
  "version": "v1",
  "published": "2016-12-14T12:40:46.000Z",
  "updated": "2016-12-14T12:40:46.000Z",
  "title": "Almost partitioning the hypercube into copies of a graph",
  "authors": [
    "Vytautas Gruslys",
    "Shoham Letzter"
  ],
  "comment": "13 pages, 1 figure",
  "categories": [
    "math.CO"
  ],
  "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$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-12-14T12:40:46.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C70"
    ],
    "keywords": [
      "error term",
      "partitioning",
      "induced copies"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 13,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}