David Conlon


I have been a Junior Research Fellow at St John's College, Cambridge since October 2007, having completed a PhD under the supervision
of Professor W.T. Gowers. This autumn I plan to attend the program on combinatorics due to be held at IPAM in Los Angeles.

My principal research interest is Ramsey theory, although I am interested in almost all aspects of combinatorics and number theory.

Here are some of my papers:

 The Ramsey number of dense graphs, submitted.

 An improved bound for the stepping-up lemma, with J. Fox and B. Sudakov, submitted.

 Weak quasi-randomness for uniform hypergraphs, with H. Han, Y. Person and M. Schacht, submitted.

 On-line Ramsey numbers, to appear in SIAM J. Discrete Math.

 Large almost monochromatic subsets in hypergraphs, with J. Fox and B. Sudakov, to appear in Israel J. Math.

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

 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.

 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.