A note on the structure of Turán densities of hypergraphs (Q937246)

A real number \(\alpha\in [0,1)\) is a jump for the integer \(r \geq 2\) if \(\exists c>0\) s.t. no number \(\in (\alpha, \alpha+c)\) can be the Turán density of a family of \(r\)-uniform hypergraphs. The Erdős - Stone theorem implies that every \(\alpha\) is a jump in case of graphs. Erdős asked whether the same applies for all uniform hypergraphs. The answer is negative: Frankl and Rödl gave an infinite sequence of non-jumps for each \(r\geq 3.\) This paper gives an other infinite sequence of non-jumps for \(r=4\), one of which extends for all possible \(r.\) The method is similar to the original Frankl - Rödl's method.