The sparse regularity lemma and its applications

MaRDI QIDQ3416250zbMATH OpenFDO

Authors Stefanie Gerke, Angelika Steger

Publication date 19 January 2007

zbMATH Keywords

probabilistic embeding lemmaregularity lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• Szemerédi's regularity Lemma for matrices and sparse graphs
• scientific article; zbMATH DE number 2086426
• The Blow-up Lemma
• The graph regularity method: variants, applications, and alternative methods
• Szemerédi’s Regularity Lemma for Sparse Graphs

Cited in

(35)

• A new proof of the KŁR conjecture
• Regular partitions of gentle graphs
• Local resilience for squares of almost spanning cycles in sparse random graphs
• Extremal results in sparse pseudorandom graphs
• \(K_4\)-free subgraphs of random graphs revisited
• The threshold bias of the clique-factor game
• A note on counting orientations
• On an anti-Ramsey property of random graphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Ramsey games near the critical threshold
• SPARSE PARTITION REGULARITY
• On an anti-Ramsey threshold for random graphs
• On the number of orientations of random graphs with no directed cycles of a given length
• The Blow-up Lemma
• The size Ramsey number of short subdivisions of bounded degree graphs
• On the KŁR conjecture in random graphs
• Large Rainbow Cliques in Randomly Perturbed Dense Graphs
• Ramsey goodness of clique versus paths in random graphs
• Independent sets in hypergraphs
• Tuza's conjecture is asymptotically tight for dense graphs
• A probabilistic counting lemma for complete graphs
• The regularity method for graphs with few 4‐cycles
• On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles
• Diagonal Ramsey via effective quasirandomness
• The size‐Ramsey number of cubic graphs
• A unified view of graph regularity via matrix decompositions
• Ramsey goodness of trees in random graphs
• Turán‐type problems for long cycles in random and pseudo‐random graphs
• Sparse partition universal graphs for graphs of bounded degree
• Transference for loose Hamilton cycles in random 3-uniform hypergraphs
• On the size-Ramsey number of grids
• Size-Ramsey numbers of structurally sparse graphs
• Bandwidth theorem for random graphs
• Small subsets inherit sparse \(\varepsilon\)-regularity
• Turán's theorem for pseudo-random graphs

This page was built for publication: The sparse regularity lemma and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3416250)