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 2023Show all

2 papers · 1 filter

math.CO2023

The asymptotics of $r (4, t)$

Sam Mattheus, Jacques Verstraete

For integers $s, t \geq 2$ , the Ramsey numbers $r (s, t)$ denote the minimum $N$ such that every $N$ -vertex graph contains either a clique of order $s$ or an independent set of order…

math.CO2023★ 1 cited

Coloring hypergraphs that are the union of nearly disjoint cliques

Dhruv Mubayi, Jacques Verstraete

We consider the maximum chromatic number of hypergraphs consisting of cliques that have pairwise small intersections. Designs of the appropriate parameters produce optimal construc…

The asymptotics of r(4,t)

Coloring hypergraphs that are the union of nearly disjoint cliques

The asymptotics of $r (4, t)$