66 citations · 544 across the 74 of their papers we have counts for
6 papers · 2 filters
Hedgehogs are not colour blind
David Conlon, Jacob Fox, Vojtěch Rödl
We exhibit a family of -uniform hypergraphs with the property that their -colour Ramsey numbers grow polynomially in the number of vertices, while their -colour Ramsey num…
Some advances on Sidorenko's conjecture
David Conlon, Jeong Han Kim, Choongbum Lee +1
A bipartite graph is said to have Sidorenko's property if the probability that the uniform random mapping from to the vertex set of any graph is a homomorphism is at…
Short proofs of some extremal results II
David Conlon, Jacob Fox, Benny Sudakov
We prove several results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly from ext…
Rational exponents in extremal graph theory
Boris Bukh, David Conlon
Given a family of graphs , the extremal number is the largest for which there exists a graph with vertices and edges containi…
Almost-spanning universality in random graphs
David Conlon, Asaf Ferber, Rajko Nenadov +1
A graph is said to be -universal if it contains every graph on vertices with maximum degree at most . It is known that for any and any…
Recent developments in graph Ramsey theory
David Conlon, Jacob Fox, Benny Sudakov
Given a graph , the Ramsey number is the smallest natural number such that any two-colouring of the edges of contains a monochromatic copy of . The existence…