Density theorems and extremal hypergraph problems (Q2382340): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02771992 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2049368166 / rank | |||
Normal rank | |||
Latest revision as of 08:39, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Density theorems and extremal hypergraph problems |
scientific article |
Statements
Density theorems and extremal hypergraph problems (English)
0 references
9 October 2007
0 references
The goal of this clearly written, nice paper is to give new, qualitative proofs for the density versions of some combinatorial partition theorems by Szemerédi, Furstenberg and Katznelson. The main tool of the investigation is the so-called removal lemma, proved by Gowers and, independently, by Nagle, Rödl, Schacht and Sokan.
0 references
removal lemma
0 references
Szemerédi's regularity lemma
0 references
ergodic theory
0 references
0 references
