Theorem (Triangle-free Lemma). For all $\eta>0$ there exists $c > 0$ and $n\_0$ so that every graph $G$ on $n>n\_0$ vertices, which contains at most $cn^3$ triangles can be made
triangle free by removing at most $\eta\binom{n}{2}$ edges.


I am trying to find some information related to this topic, I am unable to access the orignal paper by Ruzsa & Szemeredi. 


Does anyone know any useful papers/books on the triangle-free lemma? 



Triangle-free Lemma
Possibly an even better place to look is in surveys on graph property testing; this is by far the most common use nowadays of the triangle removal lemma, and any sufficiently good introduction to the subject should have some information on it. (I haven't actually read it, but I believe the most recent edition of Alon and Spencer's *The Probabilistic Method* has a chapter on property testing. If you have access to a copy, assuming the new chapter is anywhere near as good as the rest of the book, that would be my first recommendation.)


If you want a proof and some applications to more traditional combinatorics, Tim Gowers has a wonderful two-paragraph sketch and some discussion [here](http://gowers.wordpress.com/2009/01/30/background-to-a-polymath-project/) (about halfway down the post).


