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

zbMATH Open1373.05091MaRDI QIDQ4589009FDOQ4589009

Authors: Jacob Fox 

Publication date: 6 November 2017

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

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)

Cited In (8)

• Holes in graphs
• The sparse regularity lemma and its applications
• Variants of k-regular nearest neighbor graph and their construction
• Title not available (Why is that?)
• Szemerédi's regularity lemma revisited
• A fast new algorithm for weak graph regularity
• Regularity lemmas for graphs
• Title not available (Why is that?)

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)