Graph removal lemmas

@inproceedings{Conlon2013GraphRL,
  title={Graph removal lemmas},
  author={David Conlon and Jacob Fox},
  booktitle={Surveys in Combinatorics},
  year={2013}
}
The graph removal lemma states that any graph on n vertices with o(n) copies of a fixed graph H may be made H-free by removing o(n) edges. Despite its innocent appearance, this lemma and its extensions have several important consequences in number theory, discrete geometry, graph theory and computer science. In this survey we discuss these lemmas, focusing in particular on recent improvements to their quantitative aspects. 
Highly Cited
This paper has 41 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 112 references

A new proof of the graph removal lemma

  • J. Fox
  • Ann. of Math. 174
  • 2011
Highly Influential
18 Excerpts

A Szemerédi-type regularity lemma in abelian groups

  • B. Green
  • with applications, Geom. Funct. Anal. 15
  • 2005
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…