Video Lectures

Separate tags with a comma.

The Graph Removal Lemma

Jacob Fox

Let H be a fixed graph with h vertices. The graph removal lemma states that every graph on n vertices with o(nh) copies of H can be made H-free by removing o(n2) edges. We give a new proof which avoids Szemeredi's regularity lemma and...