Hypergraph $F$-designs for arbitrary $F$

We solve the existence problem for $F$-designs for arbitrary $r$-uniform hypergraphs $F$. In particular, this shows that, given any $r$-uniform hypergraph $F$, the trivially necessary divisibility conditions are sufficient to guarantee a decomposition of any sufficiently large complete $r$-uniform hypergraph $G=K_n^{(r)}$ into edge-disjoint copies of $F$, which answers a question asked e.g. by Keevash. The graph case $r=2$ forms one of the cornerstones of design theory and was proved by Wilson in 1975. The case when $F$ is complete corresponds to the existence of block designs, a problem going back to the 19th century, which was first settled by Keevash. More generally, our results extend to $F$-designs of quasi-random hypergraphs $G$ and of hypergraphs $G$ of suitably large minimum degree. Our approach builds on results and methods we recently introduced in our new proof of the existence conjecture for block designs.

[1]  H. Hanani.  DECOMPOSITION OF HYPERGRAPHS INTO OCTAHEDRA * , 1979 .

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

[3]  Alexandr V. Kostochka,et al.  On independent sets in hypergraphs , 2011, Random Struct. Algorithms.

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

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

[6]  Daniela Kühn,et al.  Edge‐disjoint Hamilton cycles in random graphs , 2011, Random Struct. Algorithms.

[7]  A. Cauchy,et al.  Exercices d'analyse et de physique mathématique , 1840 .

[8]  Peter Keevash.  Counting designs , 2015 .

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

[10]  Shachar Lovett,et al.  Probabilistic Existence of Large Sets of Designs , 2018, SODA.

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

[12]  Noga Alon,et al.  On a Hypergraph Matching Problem , 2005, Graphs Comb..

[13]  S. Schechter,et al.  On the Inversion of Certain Matrices , 2018 .

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

[15]  Luc Teirlinck.  Non-trivial t-designs without repeated blocks exist for all t , 1987, Discret. Math..

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

[17]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

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

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

[20]  Dan Archdeacon.  Self-dual embeddings of complete multipartite graphs , 1994, J. Graph Theory.

[21]  Shachar Lovett,et al.  Probabilistic existence of regular combinatorial structures , 2011, ArXiv.

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

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

[24]  C. Colbourn,et al.  Handbook of Combinatorial Designs , 2006 .

[25]  Marek Karpinski,et al.  An XOR-based erasure-resilient coding scheme , 1995 .

[26]  Alan C. H. Ling,et al.  Asymptotic Existence of Resolvable Graph Designs , 2007, Canadian Mathematical Bulletin.

[27]  Vojtech Rödl,et al.  On a Packing and Covering Problem , 1985, Eur. J. Comb..

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

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

[30]  Vojtech Rödl,et al.  Note on Independent Sets in Steiner Systems , 1994, Random Struct. Algorithms.