David Conlon
| David Conlon | |
|---|---|
| Born |
1982 (age 33–34) Ireland |
| Nationality | Irish |
| Fields | Mathematics |
| Institutions | University of Oxford |
| Alma mater |
University of Cambridge Trinity College Dublin |
| Doctoral advisor | Timothy Gowers |
| Notable awards | European Prize in Combinatorics (2011) |
David Conlon (born 1982) is an Irish mathematician. He earned a Ph.D. from Cambridge University in 2009;[1] he is a fellow of Wadham College, Oxford and a lecturer in the department of mathematics 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.[2]
Conlon has worked in Ramsey theory. In particular, he proved the first superpolynomial improvement on the Erdős–Szekeres bound on diagonal Ramsey numbers.[3]
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.[4]
References
- ↑ David Conlon at the Mathematics Genealogy Project
- ↑ "Dr David Conlon". University of Oxford. University of Oxford. Retrieved 25 April 2014.
- ↑ 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.
External links
- David Conlon at the Mathematics Genealogy Project
- Home page at Oxford
- Google scholar profile
- David Conlon's results at the International Mathematical Olympiad
|