## A Variant of the Hypergraph Removal Lemma

- Dec. 5, 2012
- 3:30 p.m.
- LeConte 312

## Abstract

In his similarly titled paper, Terence Tao gives a relatively short and self-contained proof of a strengthening of the hypergraph removal lemma by rephrasing the problem in a probabilistic framework. This lemma implies results of Szemeredi on arithmetic progressions as well as other generalizations on arithmetic progressions. As a special case, it also implies the Triangle Removal Lemma, tripartite graph version, which allows one to approximate a tripartite graph with bounded number of triangles by a triangle-free tripartite graph. In my talk, I will give an overview of this paper and the motivations behind it.