David Conlon
Research Subjects
Research Interests
David Conlon has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Jacob Fox
Department of Mathematics, Stanford University, Stanford, USA
6 shared publications - Choongbum Lee
Department of Mathematics MIT 02139-4307 Cambridge MA
4 shared publications - Benny Sudakov
ETH Zurich, Switzerland
3 shared publications - Benny Sudakov
Department of Mathematics ETH 8092 Zurich Switzerland
3 shared publications - W. Timothy Gowers
Department of Pure Mathematics and Mathematical Statistics, Wilberforce Road, Cambridge CB3 0WB, UK
2 shared publications - Andrew Lee
Department of Mathematics MIT 02139-4307 Cambridge MA
1 shared publication
Latest Publications
- Open Access
Sidorenko's conjecture for higher tree decompositions
This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for strongly tree-decomposable graphs may be extended to a broader class, comparable to that given in work of Szegedy, through further iteration.
Open AccessSidorenko's conjecture for higher tree decompositions
This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for strongly tree-decomposable graphs may be extended to a broader class, comparable to that given in work of Szegedy, through further iteration.
- Open Access
Hereditary quasirandomness without regularity
A result of Simonovits and S\'os states that for any fixed graph $H$ and any $\epsilon > 0$ there exists $\delta > 0$ such that if $G$ is an $n$-vertex graph with the property that every $S \subseteq V(G)$ contains $p^{e(H)} |S|^{v(H)} \pm \delta n^{v(H)}$ labeled copies of $H$, then $G$ is quasirandom in the sense that every $S \subseteq V(G)$ contains $\frac{1}{2} p |S|^2 \pm \epsilon n^2$ edges. The original proof of this result makes heavy use of the regularity lemma, resulting in a bound on $\delta^{-1}$ which is a tower of twos of height polynomial in $\epsilon^{-1}$. We give an alternative proof of this theorem which avoids the regularity lemma and shows that $\delta$ may be taken to be linear in $\epsilon$ when $H$ is a clique and polynomial in $\epsilon$ for general $H$. This answers a problem raised by Simonovits and S\'os.Open AccessHereditary quasirandomness without regularity
A result of Simonovits and S\'os states that for any fixed graph $H$ and any $\epsilon > 0$ there exists $\delta > 0$ such that if $G$ is an $n$-vertex graph with the property that every $S \subseteq V(G)$ contains $p^{e(H)} |S|^{v(H)} \pm \delta n^{v(H)}$ labeled copies of $H$, then $G$ is quasirandom in the sense that every $S \subseteq V(G)$ contains $\frac{1}{2} p |S|^2 \pm \epsilon n^2$ edges. The original proof of this result makes heavy use of the regularity lemma, resulting in a bound on $\delta^{-1}$ which is a tower of twos of height polynomial in $\epsilon^{-1}$. We give an alternative proof of this theorem which avoids the regularity lemma and shows that $\delta$ may be taken to be linear in $\epsilon$ when $H$ is a clique and polynomial in $\epsilon$ for general $H$. This answers a problem raised by Simonovits and S\'os. - Open Access
Freiman homomorphisms on sparse random sets
A result of Fiz Pontiveros shows that if $A$ is a random subset of $\mathbb{Z}_N$ where each element is chosen independently with probability $N^{-1/2+o(1)}$, then with high probability every Freiman homomorphism defined on $A$ can be extended to a Freiman homomorphism on the whole of $\mathbb{Z}_N$. In this paper we improve the bound to $CN^{-2/3}(\log N)^{1/3}$, which is best possible up to the constant factor.Open AccessFreiman homomorphisms on sparse random sets
A result of Fiz Pontiveros shows that if $A$ is a random subset of $\mathbb{Z}_N$ where each element is chosen independently with probability $N^{-1/2+o(1)}$, then with high probability every Freiman homomorphism defined on $A$ can be extended to a Freiman homomorphism on the whole of $\mathbb{Z}_N$. In this paper we improve the bound to $CN^{-2/3}(\log N)^{1/3}$, which is best possible up to the constant factor. - Open Access
Ordered Ramsey numbers
Given a labeled graph $H$ with vertex set $\{1, 2,\ldots,n\}$, the ordered Ramsey number $r_<(H)$ is the minimum $N$ such that every two-coloring of the edges of the complete graph on $\{1, 2, \ldots,N\}$ contains a copy of $H$ with vertices appearing in the same order as in $H$. The ordered Ramsey number of a labeled graph $H$ is at least the Ramsey number $r(H)$ and the two coincide for complete graphs. However, we prove that even for matchings there are labelings where the ordered Ramsey number is superpolynomial in the number of vertices. Among other results, we also prove a general upper bound on ordered Ramsey numbers which implies that there exists a constant $c$ such that $r_<(H) \leq r(H)^{c \log^2 n}$ for any labeled graph $H$ on vertex set $\{1,2, \dots, n\}$.Open AccessOrdered Ramsey numbers
Given a labeled graph $H$ with vertex set $\{1, 2,\ldots,n\}$, the ordered Ramsey number $r_<(H)$ is the minimum $N$ such that every two-coloring of the edges of the complete graph on $\{1, 2, \ldots,N\}$ contains a copy of $H$ with vertices appearing in the same order as in $H$. The ordered Ramsey number of a labeled graph $H$ is at least the Ramsey number $r(H)$ and the two coincide for complete graphs. However, we prove that even for matchings there are labelings where the ordered Ramsey number is superpolynomial in the number of vertices. Among other results, we also prove a general upper bound on ordered Ramsey numbers which implies that there exists a constant $c$ such that $r_<(H) \leq r(H)^{c \log^2 n}$ for any labeled graph $H$ on vertex set $\{1,2, \dots, n\}$. - Open Access
Short proofs of some extremal results II
We prove several results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly from extremal graph theory and Ramsey theory, have been collected together because in each case the relevant proofs are quite short.
Open AccessShort proofs of some extremal results II
We prove several results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly from extremal graph theory and Ramsey theory, have been collected together because in each case the relevant proofs are quite short.
- Open Access
Almost-spanning universality in random graphs
A graph $G$ is said to be $\mathcal H(n,\Delta)$-universal if it contains every graph on $n$ vertices with maximum degree at most $\Delta$. It is known that for any $\varepsilon > 0$ and any natural number $\Delta$ there exists $c > 0$ such that the random graph $G(n,p)$ is asymptotically almost surely $\mathcal H((1-\varepsilon)n,\Delta)$-universal for $p \geq c (\log n/n)^{1/\Delta}$. Bypassing this natural boundary, we show that for $\Delta \geq 3$ the same conclusion holds when $p = \omega\left(n^{-\frac{1}{\Delta-1}}\log^5 n\right)$.Open AccessAlmost-spanning universality in random graphs
A graph $G$ is said to be $\mathcal H(n,\Delta)$-universal if it contains every graph on $n$ vertices with maximum degree at most $\Delta$. It is known that for any $\varepsilon > 0$ and any natural number $\Delta$ there exists $c > 0$ such that the random graph $G(n,p)$ is asymptotically almost surely $\mathcal H((1-\varepsilon)n,\Delta)$-universal for $p \geq c (\log n/n)^{1/\Delta}$. Bypassing this natural boundary, we show that for $\Delta \geq 3$ the same conclusion holds when $p = \omega\left(n^{-\frac{1}{\Delta-1}}\log^5 n\right)$. - Open Access
Recent developments in graph Ramsey theory
Given a graph $H$, the Ramsey number $r(H)$ is the smallest natural number $N$ such that any two-colouring of the edges of $K_N$ contains a monochromatic copy of $H$. The existence of these numbers has been known since 1930 but their quantitative behaviour is still not well understood. Even so, there has been a great deal of recent progress on the study of Ramsey numbers and their variants, spurred on by the many advances across extremal combinatorics. In this survey, we will describe some of this progress.Open AccessRecent developments in graph Ramsey theory
Given a graph $H$, the Ramsey number $r(H)$ is the smallest natural number $N$ such that any two-colouring of the edges of $K_N$ contains a monochromatic copy of $H$. The existence of these numbers has been known since 1930 but their quantitative behaviour is still not well understood. Even so, there has been a great deal of recent progress on the study of Ramsey numbers and their variants, spurred on by the many advances across extremal combinatorics. In this survey, we will describe some of this progress. - Open Access
On the grid Ramsey problem and related questions
The Hales--Jewett theorem is one of the pillars of Ramsey theory, from which many other results follow. A celebrated theorem of Shelah says that Hales--Jewett numbers are primitive recursive. A key tool used in his proof, now known as the cube lemma, has become famous in its own right. In its simplest form, this lemma says that if we color the edges of the Cartesian product $K_n \times K_n$ in $r$ colors then, for $n$ sufficiently large, there is a rectangle with both pairs of opposite edges receiving the same color. Shelah's proof shows that $n = r^{\binom{r+1}{2}} + 1$ suffices. More than twenty years ago, Graham, Rothschild and Spencer asked whether this bound can be improved to a polynomial in $r$. We show that this is not possible by providing a superpolynomial lower bound in $r$. We also discuss a number of related problems.Open AccessOn the grid Ramsey problem and related questions
The Hales--Jewett theorem is one of the pillars of Ramsey theory, from which many other results follow. A celebrated theorem of Shelah says that Hales--Jewett numbers are primitive recursive. A key tool used in his proof, now known as the cube lemma, has become famous in its own right. In its simplest form, this lemma says that if we color the edges of the Cartesian product $K_n \times K_n$ in $r$ colors then, for $n$ sufficiently large, there is a rectangle with both pairs of opposite edges receiving the same color. Shelah's proof shows that $n = r^{\binom{r+1}{2}} + 1$ suffices. More than twenty years ago, Graham, Rothschild and Spencer asked whether this bound can be improved to a polynomial in $r$. We show that this is not possible by providing a superpolynomial lower bound in $r$. We also discuss a number of related problems. - Open Access
The Erdős-Gyárfás problem on generalized Ramsey numbers
Fix positive integers $p$ and $q$ with $2 \leq q \leq {p \choose 2}$. An edge-coloring of the complete graph $K_n$ is said to be a $(p, q)$-coloring if every $K_p$ receives at least $q$ different colors. The function $f(n, p, q)$ is the minimum number of colors that are needed for $K_n$ to have a $(p,q)$-coloring. This function was introduced by Erd\H{o}s and Shelah about 40 years ago, but Erd\H{o}s and Gy\'arf\'as were the first to study the function in a systematic way. They proved that $f(n, p, p)$ is polynomial in $n$ and asked to determine the maximum $q$, depending on $p$, for which $f(n,p,q)$ is subpolynomial in $n$. We prove that the answer is $p-1$.Open AccessThe Erdős-Gyárfás problem on generalized Ramsey numbers
Fix positive integers $p$ and $q$ with $2 \leq q \leq {p \choose 2}$. An edge-coloring of the complete graph $K_n$ is said to be a $(p, q)$-coloring if every $K_p$ receives at least $q$ different colors. The function $f(n, p, q)$ is the minimum number of colors that are needed for $K_n$ to have a $(p,q)$-coloring. This function was introduced by Erd\H{o}s and Shelah about 40 years ago, but Erd\H{o}s and Gy\'arf\'as were the first to study the function in a systematic way. They proved that $f(n, p, p)$ is polynomial in $n$ and asked to determine the maximum $q$, depending on $p$, for which $f(n,p,q)$ is subpolynomial in $n$. We prove that the answer is $p-1$. - Open Access
Ramsey numbers of cubes versus cliques
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertices. The Ramsey number r(Q_n, K_s) is the minimum N such that every graph of order N contains the cube graph Q_n or an independent set of order s. Burr and Erdos in 1983 asked whether the simple lower bound r(Q_n, K_s) >= (s-1)(2^n - 1)+1 is tight for s fixed and n sufficiently large. We make progress on this problem, obtaining the first upper bound which is within a constant factor of the lower bound.
Open AccessRamsey numbers of cubes versus cliques
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertices. The Ramsey number r(Q_n, K_s) is the minimum N such that every graph of order N contains the cube graph Q_n or an independent set of order s. Burr and Erdos in 1983 asked whether the simple lower bound r(Q_n, K_s) >= (s-1)(2^n - 1)+1 is tight for s fixed and n sufficiently large. We make progress on this problem, obtaining the first upper bound which is within a constant factor of the lower bound.