66 citations · 544 across the 74 of their papers we have counts for
6 papers · 1 filter
A New Bound for the Brown--Erdős--Sós Problem
David Conlon, Lior Gishboliner, Yevgeny Levanzov +1
Let denote the maximum number of edges in a -uniform hypergraph not containing edges spanned by at most vertices. One of the most influential open problems in…
Short proofs of some extremal results III
David Conlon, Jacob Fox, Benny Sudakov
We prove a selection of results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly f…
Ramsey games near the critical threshold
David Conlon, Shagnik Das, Joonkyung Lee +1
A well-known result of Rödl and Ruciński states that for any graph there exists a constant such that if , then the random graph is a.a.s.…
Books versus triangles at the extremal density
David Conlon, Jacob Fox, Benny Sudakov
A celebrated result of Mantel shows that every graph on vertices with edges must contain a triangle. A robust version of this result, due to Rademac…
More on the extremal number of subdivisions
David Conlon, Oliver Janzer, Joonkyung Lee
Given a graph , the extremal number is the largest number of edges in an -free graph on vertices. We make progress on a number of conjectures about the…
Independent arithmetic progressions
David Conlon, Jacob Fox, Benny Sudakov
We show that there is a positive constant such that any graph on vertex set with at most edges contains an independent set of order whose vertices…