Prefer a chat interface with context about you and your work?
A new proof of the graph removal lemma
Let H be a fixed graph with h vertices.The graph removal lemma states that every graph on n vertices with o(n h ) copies of H can be made H-free by removing o(n 2 ) edges.We give a new proof which avoids Szemerédi's regularity lemma and gives a better bound.This …