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

Showing 2024Show all

6 papers · 1 filter

math.CO2024

When are off-diagonal hypergraph Ramsey numbers polynomial?

David Conlon, Jacob Fox, Benjamin Gunby +5

A natural open problem in Ramsey theory is to determine those $3$ -graphs $H$ for which the off-diagonal Ramsey number $r (H, K_{n}^{(3)})$ grows polynomially with $n$ . We make substan…

math.CO2024

Independent Sets in Hypergraphs

Jacques Verstraete, Chase Wilson

A theorem of Shearer states that every $n$ -vertex triangle-free graph of maximum degree $d \geq 2$ contains an independent set of size at least $(d\log d - d + 1)/(d - 1)^2 \cdot n…

math.CO2024

Erdős-Rogers functions for arbitrary pairs of graphs

Dhruv Mubayi, Jacques Verstraete

Let $f_{F, G} (n)$ be the largest size of an induced $F$ -free subgraph that every $n$ -vertex $G$ -free graph is guaranteed to contain. We prove that for any triangle-free graph $F$ , \…

math.CO2024

On off-diagonal hypergraph Ramsey numbers

David Conlon, Jacob Fox, Benjamin Gunby +4

A fundamental problem in Ramsey theory is to determine the growth rate in terms of $n$ of the Ramsey number $r (H, K_{n}^{(3)})$ of a fixed $3$ -uniform hypergraph $H$ versus the compl…

math.CO2024

A question of Erdős and Graham on Egyptian fractions

David Conlon, Jacob Fox, Xiaoyu He +4

Answering a question of Erdős and Graham, we show that for each fixed positive rational number $x$ the number of ways to write $x$ as a sum of reciprocals of distinct positive inte…

math.CO2024★ 1 cited

On the order of Erdős-Rogers functions

Dhruv Mubayi, Jacques Verstraete

For an integer $n \geq 1$ , the Erdős-Rogers function $f_{s} (n)$ is the maximum integer $m$ such that every $n$ -vertex $K_{s + 1}$ -free graph has a $K_{s}$ -free subgraph with $m$ vertic…