On non-strong jumping numbers and density structures of hypergraphs

Abstract

Estimating Turán densities of hypergraphs is believed to be one of the most challenging problems in extremal set theory. The concept of ‘jump’ concerns the distribution of Turán densities. A number α ∈ [ 0 , 1 ) is a jump for r -uniform graphs if there exists a constant c > 0 such that for any family F of r -uniform graphs, if the Turán density of F is greater than α , then the Turán density of F is at least α + c . A fundamental result in extremal graph theory due to Erdős and Stone implies that every number in [ 0 , 1 ) is a jump for graphs. Erdős also showed that every number in [ 0 , r ! / r r ) is a jump for r -uniform hypergraphs. Furthermore, Frankl and Rödl showed the existence of non-jumps for hypergraphs. Recently, more non-jumps were found in [ r ! / r r , 1 ) for r -uniform hypergraphs. But there are still a lot of unknowns regarding jumps for hypergraphs. In this paper, we propose a new but related concept–strong-jump and describe several sequences of non-strong-jumps. It might help us to understand the distribution of Turán densities for hypergraphs better by finding more non-strong-jumps.