# Combinatorial theorems in sparse random sets

@article{Conlon2010CombinatorialTI,
title={Combinatorial theorems in sparse random sets},
author={David Conlon and William T. Gowers},
journal={arXiv: Combinatorics},
year={2010}
}
• Published 18 November 2010
• Mathematics, Computer Science
• arXiv: Combinatorics
We develop a new technique that allows us to show in a unified way that many well-known combinatorial theorems, including Tur\'an's theorem, Szemer\'edi's theorem and Ramsey's theorem, hold almost surely inside sparse random sets. For instance, we extend Tur\'an's theorem to the random setting by showing that for every $\epsilon > 0$ and every positive integer $t \geq 3$ there exists a constant $C$ such that, if $G$ is a random graph on $n$ vertices where each edge is chosen independently with…
187 Citations
The typical structure of sparse $K_{r+1}$-free graphs
• Mathematics
• 2016
Two central topics of study in combinatorics are the so-called evolution of random graphs, introduced by the seminal work of Erd\H{o}s and R\'enyi, and the family of $H$-free graphs, that is, graphs
The Bandwidth Theorem in sparse graphs
• Mathematics, Computer Science
• 2020
The authors establish sparse random analogues of the Bandwidth Theorem for sparse random graphs using the regularity method based on the Regularity Lemma and the Blow-up Lemma.
On constant-multiple-free sets contained in random sets of integers
For a rational number $r>1$, a set $A$ of positive integers is called an $r$-multiple-free set if $A$ does not contain any solution of the equation $rx = y$. The extremal problem on estimating the
Turán's Theorem for random graphs
• Mathematics
• 2015
For a graph $G$, denote by $t_r(G)$ (resp. $b_r(G)$) the maximum size of a $K_r$-free (resp. $(r-1)$-partite) subgraph of $G$. Of course $t_r(G) \geq b_r(G)$ for any $G$, and Tur\'an's Theorem says
A randomized version of Ramsey's theorem
• Mathematics
Random Struct. Algorithms
• 2012
This paper combines an r-edge-coloring of G(n, p)oth randomizations and proves a threshold result for the property that no monochromatic copy of F is contained in \documentclass{article} \usepackage{amsmath,amsfonts} \pagestyle{empty}.
Dirac-type theorems in random hypergraphs
• Mathematics
Journal of Combinatorial Theory, Series B
• 2022
Random Tur\'an theorem for hypergraph cycles
• Mathematics
• 2020
Given $r$-uniform hypergraphs $G$ and $H$ the Turan number $\rm ex(G, H)$ is the maximum number of edges in an $H$-free subgraph of $G$. We study the typical value of $\rm ex(G, H)$ when
The number of subsets of integers with no $k$-term arithmetic progression
• Mathematics, Computer Science
• 2016
A weaker bound is proved, which is nevertheless sufficient to transfer the current best upper bound on r_k(n) to the sparse random setting, and a new supersaturation result is established, which roughly states that sets of size $\Theta(r_k (n)$ contain superlinearly many $k$-term arithmetic progressions.
Ramsey goodness of trees in random graphs
• Mathematics
• 2020
We say that a graph $G$ is Ramsey for $H_1$ versus $H_2$, and write $G \to (H_1,H_2)$, if every red-blue colouring of the edges of $G$ contains either a red copy of $H_1$ or a blue copy of $H_2$. In
SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS
• Mathematics
Forum of Mathematics, Sigma
• 2017
A celebrated result of Rödl and Ruciński states that for every graph $F$ , which is not a forest of stars and paths of length 3, and fixed number of colours $r\geqslant 2$ there exist positive