Vanishing Uniform Turán Densities: Characterization and Jumps
Hao Lin, Jie Ma, Wenling Zhou
Source abstract
Uniform Turán density problems ask for the minimum density threshold that guarantees a copy of a fixed 3-uniform hypergraph in every sufficiently large 3-uniform hypergraph whose edges are uniformly distributed. This line of research was initiated by Erdős and Sós in the 1980s, who introduced the notion of \emph{vertex-set Turán density} . Reiher, Rödl and Schacht later defined two related concepts, namely, the \emph{vertex-pair Turán density} and the \emph{cherry Turán density} , which satisfy the chain of inequalities . In this paper, we investigate the problem for their vanishing densities. First, we characterize the 3-uniform hypergraphs for which , thereby answering a question posed by Schacht. We show that these are precisely the so-called \emph{max-layered} 3-uniform hypergraphs recently introduced by Lamaison. Furthermore, we answer an analogous question of Lamaison for the \emph{minimum-codegree palette density} . Together, these results imply that the following are equivalent: , , and is a max-layered 3-uniform hypergraph. Let . We say that zero is a \emph{jump} for if there exists such that no -uniform hypergraph satisfies . A famous result of Reiher, Rödl and Schacht asserts that zero is a jump for . In contrast, we prove that zero is not a jump for either or . This also yields a negative answer to Schacht's well-ordering question for . Together with existing results, these findings complete the picture for all three notions of uniform Turán density at zero.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.