Regular decomposition of the edge set of graphs with applications

We introduce a new method for decomposing the edge set of a graph, and use it to replace the Regularity lemma of Szemerédi in some graph embedding problems. An algorithmic version is also given.

[1]  W. T. Gowers,et al.  Lower bounds of tower type for Szemerédi's uniformity lemma , 1997 .

[2]  Abhishek Methuku,et al.  Triangles in C 5 -free graphs and hypergraphs of girth six , 2022, J. Graph Theory.

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

[4]  E. Szemerédi.  Regular Partitions of Graphs , 1975 .

[5]  M. Simonovits,et al.  Szemeredi''s Regularity Lemma and its applications in graph theory , 1995 .

[6]  Luca Trevisan,et al.  A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs , 2013, APPROX-RANDOM.

[7]  B. Szegedy,et al.  Regularity Partitions and The Topology of Graphons , 2010, 1002.4377.

[8]  E. Szemerédi.  On sets of integers containing k elements in arithmetic progression , 1975 .

[9]  Vojtech Rödl,et al.  A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph , 1995, SIAM J. Comput..

[10]  Luca Trevisan,et al.  A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs , 2015, Theory Comput..

[11]  János Komlós,et al.  An algorithmic version of the blow-up lemma , 1998, Random Struct. Algorithms.

[12]  Ervin Györi,et al.  A note on the maximum number of triangles in a C5-free graph , 2019, J. Graph Theory.

[13]  Noga Alon,et al.  Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs , 2007, SIAM J. Comput..

[14]  David Conlon,et al.  Bounds for graph regularity and removal lemmas , 2011, ArXiv.

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

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

[17]  Peter J. Cameron,et al.  Some sequences of integers , 1989, Discret. Math..

[18]  Jacob Fox,et al.  A new proof of the graph removal lemma , 2010, ArXiv.

[19]  The regularity method for graphs with few 4‐cycles , 2020, Journal of the London Mathematical Society.

[20]  Vojtech Rödl,et al.  The Algorithmic Aspects of the Regularity Lemma , 1994, J. Algorithms.

[21]  David Conlon,et al.  Graph removal lemmas , 2012, Surveys in Combinatorics.

[22]  Nancy Eaton.  Ramsey numbers for sparse graphs , 1998, Discret. Math..

[23]  B'ela Csaba.  A new graph decomposition method for bipartite graphs , 2021 .