David Conlon

David Conlon (born 1982) is an Irish mathematician who is a Professor of Mathematics at the California Institute of Technology.

His research interests are in Hungarian-style combinatorics, particularly Ramsey theory, extremal graph theory, combinatorial number theory, and probabilistic methods in combinatorics.

He proved the first superpolynomial improvement on the Erdős–Szekeres bound on diagonal Ramsey numbers.

Conlon represented Ireland in the International Mathematical Olympiad in 1998 and 1999.

He was an undergraduate in Trinity College Dublin, where he was elected a Scholar in 2001 and graduated in 2003.

He earned a PhD from Cambridge University in 2009.

He won the European Prize in Combinatorics in 2011 for his work in Ramsey theory and for his progress on Sidorenko's conjecture, and the Whitehead Prize in 2019.

He won the European Prize in Combinatorics in 2011, for his work in Ramsey theory and for his progress on Sidorenko's conjecture that, for any bipartite graph H, uniformly random graphons have the fewest subgraphs isomorphic to H when the edge density is fixed.

In 2019 he moved to California Institute of Technology, having been a fellow of Wadham College, Oxford and Professor of Discrete Mathematics in the Mathematics Institute at the University of Oxford.

Conlon has worked in Ramsey theory, and he proved the first superpolynomial improvement on the Erdős–Szekeres bound on diagonal Ramsey numbers.

He was awarded the Whitehead Prize in 2019 "in recognition of his many contributions to combinatorics".