David Conlon

David Conlon (born 1982) is an Irish mathematician who is currently a Professor of Mathematics at Caltech. He represented Ireland in the International Mathematical Olympiad in 1998 and 1999.[1] He was an undergraduate in Trinity College Dublin, where he was elected a Scholar in 2001[2] and graduated in 2003. He earned a Ph.D. from Cambridge University in 2009.[3] In 2019 he moved to Caltech, having been a fellow of Wadham College, Oxford and Professor of Discrete Mathematics in the Mathematics Institute at the University of Oxford.[4] His research interests are in Hungarian-style combinatorics, particularly Ramsey theory, extremal graph theory, combinatorial number theory, and probabilistic methods in combinatorics.[5]

David Conlon
Born	1982 (age 38–39) Ireland
Nationality	Irish
Alma mater	University of Cambridge Trinity College Dublin
Awards	Whitehead Prize (2019) European Prize in Combinatorics (2011)
Scientific career
Fields	Mathematics
Institutions	University of Oxford California Institute of Technology
Doctoral advisor	Timothy Gowers

Conlon has worked in Ramsey theory. In particular, he proved the first superpolynomial improvement on the Erdős–Szekeres bound on diagonal Ramsey numbers.[6]

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.[7] He was awarded the Whitehead Prize in 2019 "in recognition of his many contributions to combinatorics".[8]