Combinatorial theorems in sparse random sets
We develop a new technique that allows us to show in a unified way that many well-known combinatorial theorems, including Turán’s theorem, Szemerédi’s theorem and Ramsey’s theorem, hold almost surely inside sparse random sets. For instance, we extend Turán’s theorem to the random setting by showing...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Published: |
Princeton University, Department of Mathematics
2016
|