Statistics
Publications
36
Citations
1.5K
H-Index
25
Active since
2007
David Conlon is an author at University of Cambridge specializing in discrete mathematics, graph theory, and combinatorial optimization.
Publications per year
2007–2021
36
36
Combinatorial theorems in sparse random sets
David Conlon, W. T. Gowers · Annals of Mathematics · 2016 · 169 citations
A new upper bound for diagonal Ramsey numbers
David Conlon · Annals of Mathematics · 2009 · 156 citations · Full text
An Approximate Version of Sidorenko’s Conjecture
David Conlon, Jacob Fox, Benny Sudakov · Geometric and Functional Analysis · 2010 · 101 citations · Full text
Bounds for graph regularity and removal lemmas
David Conlon, Jacob Fox · Geometric and Functional Analysis · 2012 · 92 citations
On the KŁR conjecture in random graphs
David Conlon, W. T. Gowers, Wojciech Samotij et al. · Israel Journal of Mathematics · 2014 · 65 citations · Full text
1–5 of 36