University of Birmingham Fractional clique decompositions of dense graphs and hypergraphs

. Our main result is that every graph G on n ≥ 10 4 r 3 vertices with minimum degree δ ( G ) ≥ (1 − 1 / 10 4 r 3 / 2 ) n has a fractional K r -decomposition. Combining this result with recent work of Barber, K¨uhn, Lo and Osthus leads to the best known minimum degree thresholds for exact (non-fractional) F -decompositions for a wide class of graphs F (including large cliques). For general k -uniform hypergraphs, we give a short argument which shows that there exists a constant c k > 0 such that every k -uniform hypergraph G on n vertices with minimum codegree at least (1 − c k /r 2 k − 1 ) n has a fractional K ( k ) r decomposition, where K ( k ) r is the complete k -uniform hypergraph on r vertices. (Related fractional decomposition results for triangles have been obtained by Dross and for hypergraph cliques by Dukes as well as Yuster.) All the above new results involve purely combinatorial arguments. In particular, this yields a combinatorial proof of Wilson’s theorem that every large F -divisible complete graph has an F -decomposition.

[1]  Deryk Osthus,et al.  The existence of designs via iterative absorption , 2016 .

[2]  Daniela Kühn,et al.  On the decomposition threshold of a given graph , 2016, J. Comb. Theory, Ser. B.

[3]  Richard Montgomery,et al.  Fractional Clique Decompositions of Dense Partite Graphs , 2016, Combinatorics, Probability and Computing.

[4]  Daniela Kühn,et al.  Clique decompositions of multipartite graphs and completion of Latin squares , 2016, J. Comb. Theory, Ser. A.

[5]  Peter J. Dukes,et al.  Fractional triangle decompositions of dense $3$-partite graphs , 2015, Journal of Combinatorics.

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

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

[8]  Daniela Kühn,et al.  Edge-decompositions of graphs with high minimum degree , 2014, Electron. Notes Discret. Math..

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

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

[11]  Vojtech Rödl,et al.  Integer and fractional packings of hypergraphs , 2007, J. Comb. Theory, Ser. B.

[12]  Raphael Yuster,et al.  Fractional decompositions of dense hypergraphs , 2005, APPROX-RANDOM.

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

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

[15]  R. Wilson.  An Existence Theory for Pairwise Balanced Designs I. Composition Theorems and Morphisms , 1972, J. Comb. Theory, Ser. A.

[16]  R. Wilson.  An Existence Theory for Pairwise Balanced Designs II. The Structure of PBD-Closed Sets and the Existence Conjectures , 1972, Journal of combinatorial theory. Series A.

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

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

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

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

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

[22]  R. Wilson.  An Existence Theory for Pairwise Balanced Designs, III: Proof of the Existence Conjectures , 1975, J. Comb. Theory, Ser. A.

[23]  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.