Jacques Verstraëte

collaborators

4 papers

math.CO2026

On the ErdÅs-Rogers function

Robert Morris, Julian Sahasrabudhe, Jacques VerstraÃ«te

We show that the ErdÅs-Rogers function $f_{s, s + 1} (n)$ satisfies $f_{s, s + 1} (n) = I^ (n lo g n)$ for every $s \geq 2$ . More precisely, we construct a $K_{s + 1}$ -free graph o…

math.CO2024

Off-diagonal Ramsey numbers for slowly growing hypergraphs

Sam Mattheus, Dhruv Mubayi, Jiaxi Nie +1

For a $k$ -uniform hypergraph $F$ and a positive integer $n$ , the Ramsey number $r (F, n)$ denotes the minimum $N$ such that every $N$ -vertex $F$ -free $k$ -uniform hypergraph contains…

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.CO2024

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 $r (F, t)$ for $F$ a fixed graph and a variant of the Zarank…

On the ErdÅs-Rogers function

Off-diagonal Ramsey numbers for slowly growing hypergraphs

Big line or big convex polygon

Ramsey numbers and the Zarankiewicz problem

On the ErdÅs-Rogers function