Abstract
We say that a graph G has a perfect H-packing if there exists a set of vertex-disjoint copies of H which cover all the vertices in G. We consider various problems concerning perfect Hpackings: Given n, r, D ∈ N, we characterise the edge density threshold that ensures a perfect Kr-packing in any graph G on n vertices and with minimum degree δ(G) ≥ D. We also give two conjectures concerning degree sequence conditions which force a graph to contain a perfect H-packing. Other related embedding problems are also considered. Indeed, we give a structural
result concerning Kr-free graphs that satisfy a certain degree sequence condition.
result concerning Kr-free graphs that satisfy a certain degree sequence condition.
Original language | English |
---|---|
Article number | P57 |
Journal | The Electronic Journal of Combinatorics |
Volume | 20 |
Issue number | 1 |
Publication status | Published - 12 Mar 2013 |
Keywords
- packings
- equitable colourings