David Conlon

from Wikipedia, the free encyclopedia

David Conlon (* 1982 ) is an Irish mathematician . He is particularly concerned with extremal and probabilistic graph theory .

Life

Conlon graduated from Trinity College in Dublin in 1999 with a Bachelor's degree in 2003 (University Gold Medal) and passed Part 3 of the Tripos exams at Cambridge University with distinction. He received his PhD in Cambridge with Timothy Gowers in 2009 (Upper Bounds for Ramsey Numbers). From 2007 to 2010 he was a Junior Fellow at St. John's College, Cambridge. He is a Royal Society University Research Fellow (from 2010), Tutorial Fellow at Wadham College (from 2011) and from 2011 Lecturer in Discrete Mathematics at Oxford University .

Conlon deals with extremal graph theory , Ramsey theory , random structures in combinatorics, pseudo-random and additive combinatorics.

In 2011 he received the European Prize in Combinatorics for his work on Ramsey theory (including a new upper limit for diagonal Ramsey numbers) and advances in Sidorenko's conjecture on bipartite graphs .

Fonts

  • A New Upper Bound for Diagonal Ramsey Numbers, Annals of Mathematics, Volume 170, 2009, pp. 941–960, PDF (256 kB; English)
  • A new upper bound for the bipartite Ramsey problem ,. J. Graph Theory, 58, 2008, pp. 351-356.
  • with Jacob Fox , Benny Sudakov : Hypergraph Ramsey numbers, J. AMS 23 (2010), pp. 247-266.
  • with J. Fox, B. Sudakov: An approximate version of Sidorenko's conjecture, Geom. Funct. Anal., 20 (2010), pp. 1354-1366.
  • with J. Fox, B. Sudakov: Two extensions of Ramsey's theorem, Duke Math. J. 162 (2013), pp. 2903-2927.

Web links

Individual evidence

  1. David Conlon in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used