UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

Almost partitioning the hypercube into copies of a graph

Gruslys, V; Letzter, S; (2021) Almost partitioning the hypercube into copies of a graph. (In press).

[img] Text
1612.04603v1.pdf - Accepted version
Access restricted to UCL open access staff until 24 May 2021.

Download (326kB)

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: Article
Title: Almost partitioning the hypercube into copies of a graph
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 > 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
1Download
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item