Jacques Verstraëte

activity

20052026

most citedTuran Problems and Shadows I: Paths and Cycles

5 citations · 26 across the 34 of their papers we have counts for

collaborators

40 papers

math.CO2026

Spanning subhypergraphs with degree constraints

Noga Alon, Penny Haxell, Aleksa Milojević +1

An old result of Tutte states that any $d$ -regular graph contains a spanning subgraph in which every vertex has degree $k$ or $k + 1$ , for every $1 \leq k \leq d$ . We generalize this s…

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) = Θ (n lo g n)$ for every $s \geq 2$ . More precisely, we construct a $K_{s + 1}$ -free graph on…

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

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 Zaranki…

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…