Royal Society University Research Fellow, University Lecturer in Discrete Mathematics, Tutorial Fellow in Wadham College
University of Oxford
Andrew Wiles Building
Radcliffe Observatory Quarter
Extremal and probabilistic combinatorics, particularly extremal graph theory, Ramsey theory, random structures, pseudorandomness and additive combinatorics.
Prizes, Awards, and Scholarships:
European Prize in Combinatorics (2011)
ICM Section Lecture (2014)
Major / Recent Publications:
Graphs with few paths of prescribed length between any two vertices, submitted. A relative Szemerédi theorem, with J. Fox and Y. Zhao, submitted. Combinatorial theorems in sparse random sets, with W. T. Gowers, submitted. Extremal results in sparse pseudorandom graphs, with J. Fox and Y. Zhao, Adv. Math. 256 (2014), 206-290. Two extensions of Ramsey's theorem, with J. Fox and B. Sudakov, Duke Math. J. 162 (2013), 2903-2927. On two problems in graph Ramsey theory, with J. Fox and B. Sudakov, Combinatorica 32 (2012), 513-535. Bounds for graph regularity and removal lemmas, with J. Fox, Geom. Funct. Anal. 22 (2012), 1191-1256. 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. 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.