66 citations · 544 across the 74 of their papers we have counts for
5 papers · 1 filter
Short proofs of some extremal results
David Conlon, Jacob Fox, Benny Sudakov
We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as…
Graph removal lemmas
David Conlon, Jacob Fox
The graph removal lemma states that any graph on n vertices with o(n^{v(H)}) copies of a fixed graph H may be made H-free by removing o(n^2) edges. Despite its innocent appearance,…
Sidorenko's conjecture for a class of graphs: an exposition
David Conlon, Jacob Fox, Benny Sudakov
A famous conjecture of Sidorenko and Erdős-Simonovits states that if H is a bipartite graph then the random graph with edge density p has in expectation asymptotically the minimum…
Ramsey numbers of cubes versus cliques
David Conlon, Jacob Fox, Choongbum Lee +1
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertices. The Ramsey number r(Q_n, K_s) is the minimum N such that every graph of orde…
Extremal results in sparse pseudorandom graphs
David Conlon, Jacob Fox, Yufei Zhao
Szemerédi's regularity lemma is a fundamental tool in extremal combinatorics. However, the original version is only helpful in studying dense graphs. In the 1990s, Kohayakawa and R…