The graph removal lemma states that any graph on n vertices with o(n v(H) ) copies of a fixed graph H 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.