Three applications of the regularity method in combinatorics
Szemerédi’s regularity lemma is one of the central tools in extremal graph theory and additive combinatorics. We present three versions of this lemma tailored for three applications. The first application considered is the graph removal lemma, which states that for any graph 𝐻 on 𝑘 vertices and all...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Published: |
Massachusetts Institute of Technology
2023
|
| Online Access: | https://hdl.handle.net/1721.1/151266 |