Szemerédi's theorem
Sign in to savetheorem that long dense subsets of the integers contain arbitrarily large arithmetic progressions
In the Vinony graph
Within Vinony's link graph, Szemerédi's theorem is referenced by 42 other articles, and connects out to Paul Erdős, Klaus Roth and Robert Alexander Rankin.
Vinony files it under Additive combinatorics, Ramsey theory and Theorems in combinatorics.
Its subject is documented across 14 Wikipedia language editions.
Wikidata facts
- Instance of
- theorem
- Part of
- list of theorems
- Named after
- Endre Szemerédi
Show 4 more facts
- proved by
- Endre Szemerédi
- maintained by WikiProject
- WikiProject Mathematics
- studied by
- arithmetic combinatorics
- statement describes
- arithmetic progression
Sources (3)
via Wikidata · CC0