We study an extension of the triangle removal lemma of Ruzsa and Szemeredi [Triple systems with no six points carrying three triangles, Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. II, North-Holland, Amsterdam, 1978, pp. 939-945], which gave rise to a purely combinatorial proof of the fact that sets of integers of positive upper density contain three-term arithmetic progressions, a result first proved by Roth [On certain sets of integers, J. London Math. Soc. 28 (1953), 104-109].
CITATION STYLE
Kohayakawa, Y., RÖdlt, V., Schacht, M., & Skokan, J. (2010). On The Triangle Removal Lemma For Subgraphs of Sparse Pseudorandom Graphs (pp. 359–404). https://doi.org/10.1007/978-3-642-14444-8_10
Mendeley helps you to discover research relevant for your work.