5 papers
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…
Sums of linear transformations
David Conlon, Jeck Lim
We show that if and are linear transformations from to satisfying certain mild conditions, then, for any finite subset…
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…
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…
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 Zarank…