Loading...
Please wait, while we are loading the content...
Similar Documents
Szemerédi’s Lemma for the Analyst
| Content Provider | Semantic Scholar |
|---|---|
| Author | Lovász, László Szegedy, Balázs |
| Copyright Year | 2007 |
| Abstract | 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. |
| Starting Page | 252 |
| Ending Page | 270 |
| Page Count | 19 |
| File Format | PDF HTM / HTML |
| DOI | 10.1007/s00039-007-0599-6 |
| Alternate Webpage(s) | http://research.microsoft.com/pubs/70192/tr-2005-90.pdf |
| Alternate Webpage(s) | http://research.microsoft.com/users/lovasz/analyst.pdf |
| Alternate Webpage(s) | https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/tr-2005-90.pdf |
| Alternate Webpage(s) | http://www.cs.elte.hu/~lovasz/analyst.pdf |
| Alternate Webpage(s) | http://kam.mff.cuni.cz/~matousek/cla/lovasz-szegedy-continuousregularity.pdf |
| Alternate Webpage(s) | https://kam.mff.cuni.cz/~matousek/cla/lovasz-szegedy-continuousregularity.pdf |
| Alternate Webpage(s) | https://doi.org/10.1007/s00039-007-0599-6 |
| Volume Number | 17 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |