On Perfect Packings in Dense Graphs

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 $H$-packings: Given $n, r , D \in \mathbb N$, we characterise the edge density threshold that ensures a perfect $K_r$-packing in any graph $G$ on $n$ vertices and with minimum degree $\delta (G) \geq 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 $K_r$-free graphs that satisfy a certain degree sequence condition.

[1]  Fiachra Knox,et al.  Embedding Spanning Bipartite Graphs of Small Bandwidth , 2011, Combinatorics, Probability and Computing.

[2]  Andras Hajnal,et al.  On the maximal number of independent circuits in a graph , 1963 .

[3]  V. Chvátal.  On Hamilton's ideals , 1972 .

[4]  Hal A. Kierstead,et al.  Pósa's conjecture for graphs of order at least 2 × 108 , 2011, Random Struct. Algorithms.

[5]  Endre Szemerédi,et al.  Proof of the Seymour conjecture for large graphs , 1998 .

[6]  C. V. Eynden,et al.  A proof of a conjecture of Erdös , 1969 .

[7]  Jfinos Koml s.  Proof of the Seymour Conjecture for Large Graphs , 2005 .

[8]  P. Justesen,et al.  On Independent Circuits in Finite Graphs and a Conjecture of Erdös and Pósa. , 1988 .

[9]  Jan Hladký,et al.  A density Corrádi-Hajnal theorem , 2011, Electron. Notes Discret. Math..

[10]  Victor Alexandrov,et al.  Problem section , 2007 .

[11]  Daniela Kühn,et al.  The minimum degree threshold for perfect graph packings , 2009, Comb..

[12]  Peter Frankl,et al.  On the size of graphs with complete-factors , 1985, J. Graph Theory.

[13]  David G. Kirkpatrick,et al.  On the Complexity of General Graph Factor Problems , 1981, SIAM J. Comput..

[14]  Daniela Kühn,et al.  Critical chromatic number and the complexity of perfect packings in graphs , 2006, SODA '06.

[15]  Alexandr V. Kostochka,et al.  An Ore-type theorem on equitable coloring , 2008, J. Comb. Theory, Ser. B.

[16]  Daniela Kühn,et al.  An Ore-type Theorem for Perfect Packings in Graphs , 2008, SIAM J. Discret. Math..