Paper Info
Title
Graph removal lemmas
Abstract
The graph removal lemma states that any graph on n vertices with o(n(h)) copies of a fixed graph H on h vertices may be made H-free by removing o(n(2)) 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.
Year
Venue
Field
2012
London Mathematical Society Lecture Note Series
Strength of a graph,Discrete mathematics,Combinatorics,Line graph,Quartic graph,Cubic graph,Null graph,Distance-regular graph,Voltage graph,Mathematics,Complement graph
DocType
Volume
ISSN
Journal
409.0
0076-0552
Citations 
PageRank 
References 
4
0.56
32
Authors
2
Name
Order
Citations
PageRank
David Conlon1263.01
Jacob Fox227625.20