Andrew Suk

activity

20102024

most citedConstructions of point-line arrangements in the plane with large girth

1 citations · 1 across the 9 of their papers we have counts for

collaborators

18 papers

math.CO2024

Big line or big convex polygon

David Conlon, Jacob Fox, Xiaoyu He +3

Let $E S_{ℓ} (n)$ be the minimum $N$ such that every $N$ -element point set in the plane contains either $ℓ$ collinear members or $n$ points in convex position. We prove that th…

math.CO2022

Disjoint faces in simple drawings of the complete graph and topological Heilbronn problems

Alfredo Hubard, Andrew Suk

Given a complete simple topological graph $G$ , a $k$ -face generated by $G$ is the open bounded region enclosed by the edges of a non-self-intersecting $k$ -cycle in $G$ . Interesting…

math.CO2022

Hypergraph Ramsey numbers of cliques versus stars

David Conlon, Jacob Fox, Xiaoyu He +3

Let $K_{m}^{(3)}$ denote the complete $3$ -uniform hypergraph on $m$ vertices and $S_{n}^{(3)}$ the $3$ -uniform hypergraph on $n + 1$ vertices consisting of all $(2 n)$ edges incid…

math.CO2021

Sunflowers in set systems of bounded dimension

Jacob Fox, Janos Pach, Andrew Suk

Given a family $F$ of $k$ -element sets, $S_{1}, \dots, S_{r} \in F$ form an {\em $r$ -sunflower} if $S_{i} \cap S_{j} = S_{i^{'}} \cap S_{j^{'}}$ for all $i \neq = j$ and $i^{'} \neq = j^{'}$ …

math.CO2020

Cliques with many colors in triple systems

Dhruv Mubayi, Andrew Suk

Erdős and Hajnal constructed a 4-coloring of the triples of an $N$ -element set such that every $n$ -element subset contains 2 triples with distinct colors, and $N$ is double exponen…

math.CO2020

A note on the Erdős-Hajnal hypergraph Ramsey problem

Dhruv Mubayi, Andrew Suk, Emily Zhu

We show that there is an absolute constant $c > 0$ such that the following holds. For every $n > 1$ , there is a 5-uniform hypergraph on at least $2^{2^{c n^{1/4}}}$ vertices with inde…