Extremal aspects of graph and hypergraph decomposition problems

We survey recent advances in the theory of graph and hypergraph decompositions, with a focus on extremal results involving minimum degree conditions. We also collect a number of intriguing open problems, and formulate new ones.

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

[2]  Martin Merker,et al.  Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree , 2016, J. Comb. Theory, Ser. B.

[3]  Daniel Král,et al.  Decomposing Graphs into Edges and Triangles , 2019, Comb. Probab. Comput..

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

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

[6]  Peter J. Dukes,et al.  On the Minimum Degree Required for a Triangle Decomposition , 2020, SIAM J. Discret. Math..

[7]  Andries E. Brouwer,et al.  Steiner triple systems without forbidden subconfigurations , 1977 .

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

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

[10]  D. K. Ray-Chaudhuri,et al.  Solution of Kirkman''s schoolgirl problem , 1971 .

[11]  Peter Allen,et al.  Perfectly packing graphs with bounded degeneracy and many leaves , 2019, Israel Journal of Mathematics.

[12]  D. Kuhn,et al.  Edge-decompositions of graphs with high minimum degree , 2014, 1410.5750.

[13]  Benny Sudakov,et al.  A proof of Ringel’s conjecture , 2021, Geometric and Functional Analysis.

[14]  P. Erdös.  On extremal problems of graphs and generalized graphs , 1964 .

[15]  Charles J. Colbourn,et al.  Construction Techniques for Anti‐Pasch Steiner Triple Systems , 2000 .

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

[17]  Raphael Yuster.  Packing and Decomposition of Graphs with Trees , 2000, J. Comb. Theory, Ser. B.

[18]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[19]  Peter Keevash,et al.  The generalised Oberwolfach problem , 2020, J. Comb. Theory, Ser. B.

[20]  Zbigniew Lonc,et al.  Universal Cycle Packings and Coverings for k-Subsets of an n-Set , 2016, Graphs Comb..

[21]  Tom Bohman,et al.  Large girth approximate Steiner triple systems , 2018, J. Lond. Math. Soc..

[22]  Tommaso Traetta,et al.  A complete solution to the two-table Oberwolfach problems , 2013, J. Comb. Theory, Ser. A.

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

[24]  Matthias Kriesell,et al.  Asymptotically optimal K k -packings of dense graphs via fractional K k -decompositions , 2005 .

[25]  Raphael Yuster,et al.  Covering Graphs: The Covering Problem Solved , 1998, J. Comb. Theory, Ser. A.

[26]  Glenn H. Hurlbert.  On Universal Cycles for k-Subsets of an n-Set , 1994, SIAM J. Discret. Math..

[27]  Amelia Taylor.  On the exact decomposition threshold for even cycles , 2019, J. Graph Theory.

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

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

[30]  Daniela Kühn,et al.  The existence of designs via iterative absorption: hypergraph $F$-designs for arbitrary $F$. , 2020 .

[31]  M. Schacht,et al.  Proof of the bandwidth conjecture of Bollobás and Komlós , 2009 .

[32]  Klas Markström,et al.  Restricted completion of sparse partial Latin squares , 2019, Comb. Probab. Comput..

[33]  Dean G. Hoffman,et al.  The existence of Ck-factorizations of K2n-F , 1991, Discret. Math..

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

[35]  Daniela Kühn,et al.  On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems , 2020, Comb..

[36]  Carsten Thomassen,et al.  Claw‐decompositions and tutte‐orientations , 2006, J. Graph Theory.

[37]  D. Osthus,et al.  A bandwidth theorem for approximate decompositions , 2017, Proceedings of the London Mathematical Society.

[38]  Noga Alon,et al.  Packing and covering dense graphs , 1998 .

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

[40]  Peter Keevash,et al.  The existence of designs II , 2018, 1802.05900.

[41]  Brett Stevens,et al.  Hamiltonian decompositions of complete k-uniform hypergraphs , 2010, Discret. Math..

[42]  Zsolt Baranyai.  The edge-coloring of complete hypergraphs I , 1979, J. Comb. Theory, Ser. B.

[43]  Pawel Rzazewski,et al.  Tight Euler tours in uniform hypergraphs - computational aspects , 2017, Discret. Math. Theor. Comput. Sci..

[44]  Felix Joos,et al.  A Short Proof of the Blow-Up Lemma for Approximate Decompositions , 2020, Comb..

[45]  Packing degenerate graphs , 2017, Advances in Mathematics.

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

[47]  Carsten Thomassen,et al.  Decomposing a graph into bistars , 2013, J. Comb. Theory, Ser. B.

[48]  Raphael Yuster.  Asymptotically optimal $K_k$-packings of dense graphs via fractional $K_k$-decompositions , 2003 .

[49]  Anthony J. W. Hilton,et al.  Some Results on the Oberwolfach Problem , 2001 .

[50]  Darryn Bryant,et al.  Cycle decompositions V: Complete graphs into cycles of arbitrary lengths , 2012, 1204.3709.

[51]  Zsolt Tuza,et al.  Unsolved combinatorial problems. Part I. (BRICS Lecture Series, LS-01-1) , 2001 .

[52]  Douglas R. Stinson,et al.  The Oberwolfach problem and factors of uniform odd length cycles , 1989, J. Comb. Theory, Ser. A.

[53]  D. Kuhn,et al.  A blow-up lemma for approximate decompositions , 2016, Transactions of the American Mathematical Society.

[54]  Peter Keevash,et al.  Ringel's tree packing conjecture in quasirandom graphs , 2020, 2004.09947.

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

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

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

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

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

[60]  Miroslaw Truszczynski,et al.  Optimal F-Graphs for the Family of all K-Subsets of an N-Set , 1981, FODO.

[61]  Glenn H. Hurlbert,et al.  Near-Universal Cycles for Subsets Exist , 2009, SIAM J. Discret. Math..

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

[63]  Vojtech Rödl,et al.  Near Perfect Coverings in Graphs and Hypergraphs , 1985, Eur. J. Comb..

[64]  Fan Chung Graham,et al.  Universal cycles for combinatorial structures , 1992, Discret. Math..

[65]  Raphael Yuster,et al.  Packing Graphs: The packing problem solved , 1996, Electron. J. Comb..

[66]  Anton Kotzig,et al.  On a variation of the Oberwolfach problem , 1979, Discret. Math..

[67]  Choongbum Lee,et al.  Packing spanning graphs from separable families , 2015, 1512.08701.

[68]  D. Kuhn,et al.  Proof of the 1-factorization and Hamilton Decomposition Conjectures , 2014, 1401.4183.

[69]  D. Kuhn,et al.  Hamilton cycles in graphs and hypergraphs: an extremal perspective , 2014, 1402.4268.

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

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

[72]  Simon R. Blackburn.  The existence of k-radius sequences , 2012, J. Comb. Theory, Ser. A.

[73]  Vojtech Rödl,et al.  An approximate Dirac-type theorem for k-uniform hypergraphs , 2008, Comb..

[74]  Daniela Kühn,et al.  Minimalist designs , 2018, Random Struct. Algorithms.

[75]  Luke Postle,et al.  Progress towards Nash-Williams' conjecture on triangle decompositions , 2021, J. Comb. Theory, Ser. B.

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

[77]  Stéphan Thomassé,et al.  A proof of the Barát-Thomassen conjecture , 2017, J. Comb. Theory, Ser. B.

[78]  D. Kuhn,et al.  Resolution of the Oberwolfach problem , 2018, Journal of the European Mathematical Society.

[79]  Benny Sudakov,et al.  Embedding rainbow trees with applications to graph labelling and decomposition , 2018, Journal of the European Mathematical Society.

[80]  Daniela Kühn,et al.  Euler Tours in Hypergraphs , 2018, Comb..

[81]  Bradley W. Jackson.  Universal cycles of k-subsets and k-permutations , 1993, Discret. Math..

[82]  Victor Scharaschkin,et al.  Complete solutions to the Oberwolfach problem for an infinite set of orders , 2009, J. Comb. Theory, Ser. B.

[83]  Raphael Yuster.  Decomposing Hypergraphs into Simple Hypertrees , 2000, Comb..

[84]  Tree decomposition of graphs , 1998, Random Struct. Algorithms.

[85]  Roland Häggkvist.  Surveys in Combinatorics, 1989: Decompositions of complete bipartite graphs , 1989 .

[86]  Mike J. Grannell,et al.  The Resolution of the Anti-Pasch Conjecture , 2000 .

[87]  C. Thomassen,et al.  Claw-decompositions and tutte-orientations , 2006 .

[88]  Darryn E. Bryant,et al.  On bipartite 2‐factorizations of kn − I and the Oberwolfach problem , 2011, J. Graph Theory.

[89]  Richard Montgomery,et al.  Fractional clique decompositions of dense graphs , 2017, Random Struct. Algorithms.

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

[91]  Felix Joos,et al.  Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree , 2020, 2011.05359.

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

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

[94]  Darryn Bryant,et al.  A proof of Lindner's conjecture on embeddings of partial Steiner triple systems , 2009 .

[95]  D. Kuhn,et al.  Optimal packings of bounded degree trees , 2016, Journal of the European Mathematical Society.