48 citations · 110 across the 37 of their papers we have counts for
4 papers · 1 filter
Constructions in Ramsey theory
Dhruv Mubayi, Andrew Suk
We provide several constructions for problems in Ramsey theory. First, we prove a superexponential lower bound for the classical 4-uniform Ramsey number , and the same fo…
Off-diagonal hypergraph Ramsey numbers
Dhruv Mubayi, Andrew Suk
The Ramsey number is the minimum such that every red-blue coloring of the -subsets of contains a red set of size or a blue set of size ,…
Semi-algebraic colorings of complete graphs
Jacob Fox, Janos Pach, Andrew Suk
We consider -colorings of the edges of a complete graph, where each color class is defined semi-algebraically with bounded complexity. The case was first studied by Alon…
A polynomial regularity lemma for semi-algebraic hypergraphs and its applications in geometry and property testing
Jacob Fox, Janos Pach, Andrew Suk
Fox, Gromov, Lafforgue, Naor, and Pach proved a regularity lemma for semi-algebraic -uniform hypergraphs of bounded complexity, showing that for each the vertex set can be…