Gruslys, V;
Letzter, S;
(2016)
Almost partitioning the hypercube into copies of a graph.
ArXiv
Preview |
Text
1612.04603v1.pdf - Accepted Version Download (326kB) | Preview |
Abstract
Let H be an induced subgraph of the hypercube Qk, for some k. We show that for some c=c(H), the vertices of Qn can be partitioned into induced copies of H and a remainder of at most O(nc) vertices. We also show that the error term cannot be replaced by anything smaller than logn
Type: | Working / discussion paper |
---|---|
Title: | Almost partitioning the hypercube into copies of a graph |
Open access status: | An open access version is available from UCL Discovery |
Publisher version: | https://arxiv.org/abs/1612.04603 |
Language: | English |
Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences > Dept of Mathematics |
URI: | https://discovery.ucl.ac.uk/id/eprint/10107287 |
Downloads since deposit
Loading...
0DownloadsDownload activity - last month
Loading...
Download activity - last 12 months
Loading...
Downloads by country - last 12 months
Loading...
Archive Staff Only
View Item |