Packing the hypercube
David Offner · Discussiones Mathematicae Graph Theory · 2013
Let G be a graph that is a subgraph of some n-dimensional hypercube Q n . For sufficiently large n, Stout We prove an analogous theorem for edge-disjoint packings: For sufficiently large n, it is possible to pack edge-disjoint copies of G in Q n so that any proportion r < 1 of the edges of Q n are covered by the packing.