- Tytuł:
- Packing the Hypercube
- Autorzy:
- Offner, David
- Powiązania:
- https://bibliotekanauki.pl/articles/30147221.pdf
- Data publikacji:
- 2014-02-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
hypercube
packing
decomposition - Opis:
- Let G be a graph that is a subgraph of some n-dimensional hypercube Qn. For sufficiently large n, Stout [20] proved that it is possible to pack vertex-disjoint copies of G in Qn so that any proportion r < 1 of the vertices of Qn are covered by the packing. We prove an analogous theorem for edge-disjoint packings: For sufficiently large n, it is possible to pack edge-disjoint copies of G in Qn so that any proportion r < 1 of the edges of Qn are covered by the packing.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2014, 34, 1; 85-93
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł