David Conlon

{{short description|Irish mathematician (born 1982)|bot=PearBOT 5}}

{{Use dmy dates|date=April 2022}}

{{Infobox scientist

| name = David Conlon

| image = David Conlon October 2020.jpg

| image_size =

| caption = Conlon in 2020

| birth_date = {{Birth year and age|1982}}

| birth_place = Ireland

| death_date =

| death_place =

| fields = Mathematics

| workplaces = University of Oxford
California Institute of Technology

| alma_mater = University of Cambridge
Trinity College Dublin

| doctoral_advisor = Timothy Gowers

| doctoral_students =

| known_for =

| awards = Whitehead Prize (2019)
European Prize in Combinatorics (2011)

}}

David Conlon (born 1982) is an Irish mathematician who is a Professor of Mathematics at the California Institute of Technology. His research interests are in Hungarian-style combinatorics, particularly Ramsey theory, extremal graph theory, combinatorial number theory, and probabilistic methods in combinatorics.{{cite web |title=Prof. David Conlon |url=http://www.its.caltech.edu/~dconlon/ |work=Caltech Website |publisher=Caltech |accessdate=1 June 2021}} He proved the first superpolynomial improvement on the Erdős–Szekeres bound on diagonal Ramsey numbers. He won the European Prize in Combinatorics in 2011 for his work in Ramsey theory and for his progress on Sidorenko's conjecture, and the Whitehead Prize in 2019.

Life

Conlon represented Ireland in the International Mathematical Olympiad in 1998 and 1999.{{cite web|title=International Mathematical Olympiad Results for Ireland|url=https://www.imo-official.org/country_individual_r.aspx?code=IRL|accessdate=7 July 2017}} He was an undergraduate in Trinity College Dublin, where he was elected a Scholar in 2001{{cite web|title=TCD Scholars Since 1925|url=http://www.tcdlife.ie/scholars/scholar/about-list.php|accessdate=7 July 2017}} and graduated in 2003. He earned a PhD from Cambridge University in 2009.{{MathGenealogy |id=138270 }}

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.{{cite web|title=Curriculum Vitae – David Conlon|url=http://www.its.caltech.edu/~dconlon/cv.pdf|accessdate=1 June 2021}}

Conlon has worked in Ramsey theory, and he proved the first superpolynomial improvement on the Erdős–Szekeres bound on diagonal Ramsey numbers.{{cite web |last=Conlon |first=David |title=A New Upper Bound for Diagonal Ramsey Numbers |url=https://www.dpmms.cam.ac.uk/~dc340/RamseyUpper.pdf |work=www.dpmms.cam.ac.uk |publisher=University of Cambridge |accessdate=25 April 2014 |archive-date=4 March 2016 |archive-url=https://web.archive.org/web/20160304024326/https://www.dpmms.cam.ac.uk/~dc340/RamseyUpper.pdf |url-status=dead }} 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.{{citation|url=http://mta.hu/matematika_hirek/a-kombinatorika-kivalosagai-az-akademian-128508|title=A kombinatorika kiválóságai az Akadémián|publisher=Hungarian Academy of Sciences|language=Hungarian|date=September 1, 2011|url-status=dead|archiveurl=https://web.archive.org/web/20131106013006/http://mta.hu/matematika_hirek/a-kombinatorika-kivalosagai-az-akademian-128508|archivedate=November 6, 2013}}. He was awarded the Whitehead Prize in 2019 "in recognition of his many contributions to combinatorics".{{cite web|title=Whitehead Prize 2019 Citation for Professor David Conlon|url=https://www.lms.ac.uk/sites/default/files/files/d_conlon.pdf|work=London Mathematical Society|publisher=LMS|accessdate=1 June 2021}}

References

{{Reflist}}