The graph regularity method: variants, applications, and alternative methods

MaRDI QIDQ4589009zbMATH OpenFDO

Authors Jacob Fox

Publication date 6 November 2017

zbMATH Keywords

extremal combinatoricsRamsey theoryregularity lemmaprobabilistic methods

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Recommendations

• Regularity lemmas for graphs
• scientific article; zbMATH DE number 2086426
• scientific article; zbMATH DE number 878896
• Szemerédi’s Regularity Lemma for Sparse Graphs
• Szemerédi's regularity lemma revisited

Cited in

(8)

• scientific article; zbMATH DE number 1944144 (Why is no real title available?)
• The sparse regularity lemma and its applications
• Holes in graphs
• Variants of k-regular nearest neighbor graph and their construction
• scientific article; zbMATH DE number 2086426 (Why is no real title available?)
• Szemerédi's regularity lemma revisited
• A fast new algorithm for weak graph regularity
• Regularity lemmas for graphs

This page was built for publication: The graph regularity method: variants, applications, and alternative methods

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