Szemeredi's lemma for the analyst

被引：136
|
作者：
Lovasz, Laszlo
Szegedy, Balazs
机构：
[1] Eotvos Lorand Univ, Inst Math, H-1117 Budapest, Hungary
[2] Univ Toronto, Dept Math, Toronto, ON M5S 2E4, Canada
来源：
GEOMETRIC AND FUNCTIONAL ANALYSIS | 2007年 / 17卷 / 01期
关键词：
regularity lemma; cut norm; limits of graph sequences; compactness;
D O I：
10.1007/s00039-007-0599-6
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Szemeredi'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 Szemeredi's lemma can be thought of as a result in analysis. We show three different analytic interpretations.
引用
收藏
页码：252 / 270
页数：19
相关论文
共 50 条
12345