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

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

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

[4] 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.

[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.