J. Verstraete

activity

20022026

most citedTight paths in convex geometric hypergraphs

16 citations · 37 across the 24 of their papers we have counts for

collaborators

28 papers

math.CO2026

Polynomial Length Cycles In Tough Graphs

Levi Segal, Jacques Verstraete

We prove that every $n$ -vertex $15$ -tough graph contains a cycle of length $Ω (n^{1/20})$ .

math.CO2026

Logarithmic Circumference In Tough Graphs

Levi Segal, Jacques Verstraete

For every real $t > 0$ , we prove that every $2$ -connected $t$ -tough graph contains a cycle of length at least $ℓ$ whenever $n \leq ℓ (1 + 1/ t)^{⌊ ℓ /2 ⌋ - 1}$ . This…

math.CO2026

Erdős-Sós for digraphs

Dhruv Mubayi, Jacques Verstraete

It is shown that every Eulerian digraph on $n$ vertices with more than $(t - 1) n$ arcs contains every oriented tree with $t$ edges. The digraphs have no loops or repeated arcs, but o…

math.CO2026

Kalai's Conjecture for Tight Trees

Dhruv Mubayi, Jacques Verstraete

Let $r \geq 2$ and $t \geq 1$ . It is shown that if $T$ is an $r$ -uniform tight tree with $t$ edges and $H$ is a $T$ -free $r$ -uniform hypergraph, then $∣ E (H) ∣ \leq (t - 1) ∣ sh H ∣/ r$ , wher…

math.CO2026

Hypergraph Ramsey numbers with quasipolynomial growth rate

Xiaoyu He, Jiaxi Nie, Logan Post +1

For a 3-uniform hypergraph (3-graph) $F$ , let $r (F, n)$ be the smallest $N$ such that any $N$ -vertex $F$ -free 3-graph has an independent set of size $n$ . We construct a $3$ -graph $H…

math.CO2026

Large point-line matchings and small Nikodym sets

Zach Hunter, Cosmin Pohoata, Jacques Verstraete +1

For any integer $d \geq 2$ and prime power $q$ , we construct unexpectedly large induced matchings in the point-line incidence graph of $F_{q}^{d}$ by leveraging a new conn…