Edge-decompositions of graphs with high minimum degree

A fundamental theorem of Wilson states that, for every graph $F$, every sufficiently large $F$-divisible clique has an $F$-decomposition. Here a graph $G$ is $F$-divisible if $e(F)$ divides $e(G)$ and the greatest common divisor of the degrees of $F$ divides the greatest common divisor of the degrees of $G$, and $G$ has an $F$-decomposition if the edges of $G$ can be covered by edge-disjoint copies of $F$. We extend this result to graphs $G$ which are allowed to be far from complete. In particular, together with a result of Dross, our results imply that every sufficiently large $K_3$-divisible graph of minimum degree at least $9n/10+o(n)$ has a $K_3$-decomposition. This significantly improves previous results towards the long-standing conjecture of Nash-Williams that every sufficiently large $K_3$-divisible graph with minimum degree at least $3n/4$ has a $K_3$-decomposition. We also obtain the asymptotically correct minimum degree thresholds of $2n/3 +o(n)$ for the existence of a $C_4$-decomposition, and of $n/2+o(n)$ for the existence of a $C_{2\ell}$-decomposition, where $\ell\ge 3$. Our main contribution is a general `iterative absorption' method which turns an approximate or fractional decomposition into an exact one. In particular, our results imply that in order to prove an asymptotic version of Nash-Williams' conjecture, it suffices to show that every $K_3$-divisible graph with minimum degree at least $3n/4+o(n)$ has an approximate $K_3$-decomposition,

[1]  Raphael Yuster,et al.  Integer and fractional packing of families of graphs , 2005 .

[2]  Peter Keevash.  The existence of designs , 2014, 1401.3665.

[3]  Raphael Yuster,et al.  H-packing of k-chromatic graphs , 2012 .

[4]  Raphael Yuster,et al.  Edge-Disjoint Cliques in Graphs with High Minimum Degree , 2014, SIAM J. Discret. Math..

[5]  François Dross,et al.  Fractional Triangle Decompositions in Graphs with Large Minimum Degree , 2015, SIAM J. Discret. Math..

[6]  Raphael Yuster,et al.  Asymptotically optimal Kk-packings of dense graphs via fractional Kk-decompositions , 2005, J. Comb. Theory, Ser. B.

[7]  Peter J. Dukes,et al.  Rational decomposition of dense hypergraphs and some related eigenvalue estimates , 2011 .

[8]  Noga Alon,et al.  AlmostH-factors in dense graphs , 1992, Graphs Comb..

[9]  Daniela Kühn,et al.  Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments , 2012, ArXiv.

[10]  T. Gustavsson.  Decompositions of large graphs and digraphs with high minimum degree , 1991 .

[11]  Kseniya Garaschuk,et al.  Linear methods for rational triangle decompositions , 2014 .

[12]  Daniela Kühn,et al.  Fractional clique decompositions of dense graphs and hypergraphs , 2015, J. Comb. Theory, Ser. B.

[13]  M. Simonovits,et al.  Cycles of even length in graphs , 1974 .

[14]  P. Dukes.  Corrigendum to “Rational decomposition of dense hypergraphs and some related eigenvalue estimates” [Linear Algebra Appl. 436 (9) (2012) 3736–3746] , 2015 .

[15]  P. Erdös,et al.  On the structure of linear graphs , 1946 .

[16]  Ur Mathematik.  Graph Decompositions, Latin Squares, and Games , 2011 .

[17]  Nicholas J. Cavenagh,et al.  Decomposing Graphs of High Minimum Degree into 4‐Cycles , 2015, J. Graph Theory.

[18]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[19]  Michael Tarsi,et al.  Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture , 1997, SIAM J. Comput..

[20]  P. Erdos,et al.  A LIMIT THEOREM IN GRAPH THEORY , 1966 .

[21]  Richard M. Wilson,et al.  An Existence Theory for Pairwise Balanced Designs, III: Proof of the Existence Conjectures , 1975, J. Comb. Theory, Ser. A.

[22]  I. Elldős.  ON SOME NEW INEQUALITIES CONCERNING EXTREMAL PROPERTIES OF GRAPHS by , 2004 .

[23]  Michael Tarsi,et al.  Graph decomposition is NPC - a complete proof of Holyer's conjecture , 1992, STOC '92.

[24]  Michael Krivelevich,et al.  Triangle Factors in Random Graphs , 1997, Combinatorics, Probability and Computing.

[25]  Prince Camille de Polignac.  On a Problem in Combinations , 1866 .

[26]  Raphael Yuster,et al.  Combinatorial and computational aspects of graph packing and graph decomposition , 2007, Comput. Sci. Rev..

[27]  P. Lax.  Proof of a conjecture of P. Erdös on the derivative of a polynomial , 1944 .

[28]  Richard M. Wilson,et al.  An Existence Theory for Pairwise Balanced Designs II. The Structure of PBD-Closed Sets and the Existence Conjectures , 1972, J. Comb. Theory A.

[29]  Endre Szemerédi,et al.  A fast algorithm for equitable coloring , 2010, Comb..

[30]  Richard M. Wilson,et al.  An Existence Theory for Pairwise Balanced Designs I. Composition Theorems and Morphisms , 1972, J. Comb. Theory, Ser. A.

[31]  Vojtech Rödl,et al.  A Dirac-Type Theorem for 3-Uniform Hypergraphs , 2006, Combinatorics, Probability and Computing.

[32]  Rajeev Raman,et al.  The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting , 1990, FSTTCS.

[33]  Richard M. Wilson,et al.  An Existence Theory for Pairwise Balanced Designs II. The Structure of PBD-Closed Sets and the Existence Conjectures , 1972, J. Comb. Theory, Ser. A.

[34]  Raphael Yuster,et al.  The decomposition threshold for bipartite graphs with minimum degree one , 2002, Random Struct. Algorithms.

[35]  Vojtech Rödl,et al.  Integer and Fractional Packings in Dense Graphs , 2001, Comb..