David Conlon
| David Conlon | |
|---|---|
| Born |
1982 (age 35–36) Ireland |
| Nationality | Irish |
| Alma mater |
University of Cambridge Trinity College Dublin |
| Awards | European Prize in Combinatorics (2011) |
| Scientific career | |
| Fields | Mathematics |
| Institutions | University of Oxford |
| Doctoral advisor | Timothy Gowers |
David Conlon (born 1982) is an Irish mathematician. 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] He is a fellow of Wadham College, Oxford and is a Professor of Discrete Mathematics in the Mathematics Institute at the University of Oxford. His research interests are in Hungarian-style combinatorics, particularly Ramsey theory, extremal graph theory, combinatorial number theory, and probabilistic methods in combinatorics.[4]
Conlon has worked in Ramsey theory. In particular, he proved the first superpolynomial improvement on the Erdős–Szekeres bound on diagonal Ramsey numbers.[5]
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, random bipartite graphs have the fewest subgraphs isomorphic to H.[6]
References
- ↑ "International Mathematical Olympiad Results for Ireland". Retrieved 7 July 2017.
- ↑ "TCD Scholars Since 1925". Retrieved 7 July 2017.
- ↑ David Conlon at the Mathematics Genealogy Project
- ↑ "Prof. David Conlon". University of Oxford. University of Oxford. Retrieved 28 March 2018.
- ↑ Conlon, David. "A New Upper Bound for Diagonal Ramsey Numbers" (PDF). www.dpmms.cam.ac.uk. University of Cambridge. Retrieved 25 April 2014.
- ↑ A kombinatorika kiválóságai az Akadémián (in Hungarian), Hungarian Academy of Sciences, September 1, 2011, archived from the original on November 6, 2013 .
