Hypergraphs do jump

Rahil Baber, John Talbot

We say that $\alpha \in [0,1)$ is a jump for an integer $r\ge 2$ if there exists $c(\alpha )>0$ such that for all $\epsilon >0$ and all $t\ge 1$ any $r$-graph with $n\ge n_0(\alpha ,\epsilon ,t)$ vertices and d…