Combinatorial theorems relative to a random set

Abstract

We describe recent advances in the study of random analogues of combinatorial theorems.

26 pages. Submitted to Proceedings of the ICM 2014

References in corpus (5)

• Extremal results in sparse pseudorandom graphs
• On the KŁR conjecture in random graphs
• A relative Szemerédi theorem
• The Green-Tao theorem: an exposition
• Linear forms from the Gowers uniformity norm

Cited by in corpus (7)

• Further applications of the Container Method
• Path Ramsey number for random graphs
• Multicolour containers and the entropy of decorated graph limits
• Colour-biased Hamilton cycles in random graphs
• On some multicolour Ramsey properties of random graphs
• Monochromatic cycle covers in random graphs
• Triangle-free subgraphs of random graphs