David Conlon


I am a Royal Society University Research Fellow here in DPMMS and a College Research Associate in St John's College. From 2007 to
2010, I was a Junior Research Fellow at St John's College. My PhD was completed under the supervision of Professor W.T. Gowers. For a 
full CV, see here.

My principal research interest is Ramsey theory, although I am interested in almost all aspects of combinatorics and number theory.
The notes for a short course in Ramsey theory may be found here.

Notes for a course on extremal graph theory will appear here soon.

Here are some of my papers:

Two extensions of Ramsey's theorem, with J. Fox and B. Sudakov, submitted.

Bounds for graph regularity and removal lemmas, with J. Fox, submitted.

Combinatorial theorems in sparse random sets, with W.T. Gowers, submitted.

Erdos-Hajnal-type theorems in hypergraphs, with J. Fox and B. Sudakov, submitted.

On two problems in graph Ramsey theory, with J. Fox and B. Sudakov, to appear in Combinatorica.

Weak quasi-randomness for uniform hypergraphs, with H. Han, Y. Person and M. Schacht, to appear in Random Structures Algorithms.

An improved bound for the stepping-up lemma, with J. Fox and B. Sudakov, to appear in Discrete Appl. Math.

The Ramsey number of dense graphs, to appear in Bull. London Math. Soc.

On the Ramsey multiplicity of complete graphs, to appear in Combinatorica.

Large almost monochromatic subsets in hypergraphs, with J. Fox and B. Sudakov, Israel J. Math., 181 (2011), 423-432.

An approximate version of Sidorenko's conjecture, with J. Fox and B. Sudakov, Geom. Funct. Anal., 20 (2010), 1354-1366.

An extremal theorem in the hypercube, Electron. J. Combin, 17 (2010), R111.

Hypergraph Ramsey numbers, with J. Fox and B. Sudakov, J. Amer. Math. Soc., 23 (2010), 247-266.

A new upper bound for diagonal Ramsey numbers, Ann. of Math., 170 (2009), 941-960. 

Ramsey numbers of sparse hypergraphs, with J. Fox and B. Sudakov, Random Structures Algorithms, 35 (2009), 1-14.

On-line Ramsey numbers, SIAM J. Discrete Math., 23 (2009), 1954-1963.

Hypergraph packing and sparse bipartite Ramsey numbers, Combin. Probab. Comput., 18 (2009), 913-923.

A new upper bound for the bipartite Ramsey problem, J. Graph Theory 58 (2008), 351-356.

On the existence of rainbow 4-term arithmetic progression, with V. Jungic and R. Radoicic, Graphs Combin. 23 (2007), 249-254.

Rainbow solutions of linear equations over Zp, Discrete Math. 306 (2006), 2056-2063.