Name
Abstract | ||
|---|---|---|
Szemerédi's regularity lemma is a fundamental tool in extremal combinatorics. However, the original version is only helpful in studying dense graphs. In the 1990s, Kohayakawa and Rödl proved an analogue of Szemerédi's regularity lemma for sparse graphs as part of a general program toward extending extremal results to sparse graphs. Many of the key applications of Szemerédi's regularity lemma use an associated counting lemma. In order to prove extensions of these results which also apply to sparse graphs, it remained a well-known open problem to prove a counting lemma in sparse graphs. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.aim.2013.12.004 | Advances in Mathematics |
Keywords | Field | DocType |
Szemerédi's regularity lemma,Sparse regularity lemma,Counting lemma,Graph removal lemma,Extremal combinatorics,Sparse graphs | Open problem,Mathematical analysis,Zorn's lemma,Five lemma,Extremal combinatorics,Lemma (mathematics),Aubin–Lions lemma,Discrete mathematics,Topology,Combinatorics,Teichmüller–Tukey lemma,Rational root theorem,Mathematics | Journal |
Volume | ISSN | Citations |
256 | 0001-8708 | 10 |
PageRank | References | Authors |
0.73 | 42 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Conlon | 1 | 26 | 3.01 |
| Jacob Fox | 2 | 123 | 22.33 |
| Yufei Zhao | 3 | 70 | 15.60 |