66 citations · 544 across the 74 of their papers we have counts for
5 papers · 2 filters
Everywhere unbalanced configurations
David Conlon, Jeck Lim
An old problem in discrete geometry, originating with Kupitz, asks whether there is a fixed natural number such that every finite set of points in the plane has a line through…
Ramsey numbers and the Zarankiewicz problem
David Conlon, Sam Mattheus, Dhruv Mubayi +1
Building on recent work of Mattheus and Verstraëte, we establish a general connection between Ramsey numbers of the form for a fixed graph and a variant of the Zaranki…
Extremal numbers and Sidorenko's conjecture
David Conlon, Joonkyung Lee, Alexander Sidorenko
Sidorenko's conjecture states that, for all bipartite graphs , quasirandom graphs contain asymptotically the minimum number of copies of taken over all graphs with the same…
Set-coloring Ramsey numbers and error-correcting codes near the zero-rate threshold
David Conlon, Jacob Fox, Huy Tuan Pham +1
For positive integers with , the set-coloring Ramsey number is the minimum such that if every edge of the complete graph receives a set of c…
Domination inequalities and dominating graphs
David Conlon, Joonkyung Lee
We say that a graph dominates another graph if the number of homomorphisms from to any graph is dominated, in an appropriate sense, by the number of homomorphisms…