Szemerédi’s Lemma for the Analyst |
| |
| Authors: | László Lovász Balázs Szegedy |
| |
| Institution: | 1.Institute of Mathematics,E?tv?s Loránd University,Budapest,Hungary;2.Department of Mathematics,University of Toronto,Toronto,Canada |
| |
| Abstract: | Szemerédi’s regularity lemma is a fundamental tool in graph theory: it has many applications to extremal graph theory, graph
property testing, combinatorial number theory, etc. The goal of this paper is to point out that Szemerédi’s lemma can be thought
of as a result in analysis. We show three different analytic interpretations.
Received: February 2006 Revision: April 2006 Accepted: April 2006 |
| |
| Keywords: | Regularity lemma cut norm limits of graph sequences compactness |
| 本文献已被 SpringerLink 等数据库收录！ |
|
