Projects per year
Abstract
Let H be any graph. We determine up to an additive constant the minimum degree of a graph G which ensures that G has a perfect Hpacking (also called an Hfactor). More precisely, let delta(H, n) denote the smallest integer k such that every graph G whose order n is divisible by vertical bar H vertical bar and with delta(G) >= k contains a perfect Hpacking. We show that
delta(H, n) = (11/chi*(H))n + O(1).
The value of chi*(H) depends on the relative sizes of the colour classes in the optimal colourings of H and satisfies chi(H)1
Original language  English 

Pages (fromto)  65107 
Number of pages  43 
Journal  Combinatorica 
Volume  29 
Issue number  1 
DOIs  
Publication status  Published  1 Jan 2009 
Fingerprint
Dive into the research topics of 'The Minimum Degree Threshold for Perfect Graph Packings'. Together they form a unique fingerprint.Projects
 1 Finished

Probabilistic Methods in Graph Theory
Engineering & Physical Science Research Council
26/04/06 → 25/01/09
Project: Research Councils