= David Conlon
{c}
<David Conlon> studies <extremal graph theory> and <Ramsey theory>. His joint work with <Jacob Fox>, <Choongbum Lee> and <Benny Sudakov> shows that imposing a vertex order can make Ramsey problems substantially harder, even for <matchings>.<Ordered Ramsey numbers by David Conlon and others>[Original byline and abstract]{ref}
With <Joonkyung Lee> and <Alexander Sidorenko>, he also linked failures of a hypergraph analogue of the <Sidorenko conjecture> to improved extremal lower bounds. This turns a failed density inequality into information about constructions avoiding a specified <hypergraph>.<Extremal numbers and Sidorenko’s conjecture by David Conlon and others>[Abstract and introduction]{ref}
Back to article page