Removal Lemmas with Polynomial Bounds

A common theme in many extremal problems in graph theory is the relation between local and global properties of graphs. One of the most celebrated results of this type is the Ruzsa–Szemerédi triangle removal lemma, which states that if a graph is $\varepsilon $-far from being triangle free, then most subsets of vertices of size $C(\varepsilon )$ are not triangle free. Unfortunately, the best known upper bound on $C(\varepsilon )$ is given by a tower-type function, and it is known that $C(\varepsilon )$ is not polynomial in $\varepsilon ^{-1}$. The triangle removal lemma has been extended to many other graph properties, and for some of them the corresponding function $C(\varepsilon )$ is polynomial. This raised the natural question, posed by Goldreich in 2005 and more recently by Alon and Fox, of characterizing the properties for which one can prove removal lemmas with polynomial bounds. Our main results in this paper are new sufficient and necessary criteria for guaranteeing that a graph property admits a removal lemma with a polynomial bound. Although both are simple combinatorial criteria, they imply almost all prior positive and negative results of this type. Moreover, our new sufficient conditions allow us to obtain polynomially bounded removal lemmas for many properties for which the previously known bounds were of tower type. In particular, we show that every semi-algebraic graph property admits a polynomially bounded removal lemma. This confirms a conjecture of Alon.