Loading...
Please wait, while we are loading the content...
Similar Documents
Almost partitioning the hypercube into copies of a graph
| Content Provider | Semantic Scholar |
|---|---|
| Author | Gruslys, Vytautas Letzter, Shoham |
| Copyright Year | 2016 |
| 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$. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://arxiv.org/pdf/1612.04603v1.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
