Searcharxiv⌕ Search

arXiv · 2610.28574

Vanishing Uniform Turán Densities: Characterization and Jumps

Abstract

Uniform Turán density problems ask for the minimum density threshold that guarantees a copy of a fixed 3-uniform hypergraph $F$ 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} $π_{vvv}(F)$. Reiher, Rödl and Schacht later defined two related concepts, namely, the \emph{vertex-pair Turán density} $π_{ve}(F)$ and the \emph{cherry Turán density} $π_{ee}(F)$, which satisfy the chain of inequalities $π_{vvv}(F)\geπ_{ve}(F)\geπ_{ee}(F)$. In this paper, we investigate the problem for their vanishing densities. First, we characterize the 3-uniform hypergraphs $F$ for which $π_{ee}(F)=0$, 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} $π_{ee}^{\rm pal}$. Together, these results imply that the following are equivalent: $π_{ee}(F)=0$, $π_{ee}^{\rm pal}(F)=0$, and $F$ is a max-layered 3-uniform hypergraph. Let $\star \in \{vvv, ve, ee \}$. We say that zero is a \emph{jump} for $π_{\star}$ if there exists $c>0$ such that no $3$-uniform hypergraph $F$ satisfies $π_{\star}(F)\in(0,c)$. A famous result of Reiher, Rödl and Schacht asserts that zero is a jump for $π_{vvv}$. In contrast, we prove that zero is not a jump for either $π_{ve}$ or $π_{ee}$. This also yields a negative answer to Schacht's well-ordering question for $π_{ve}$. Together with existing results, these findings complete the picture for all three notions of uniform Turán density at zero.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hao Lin, Jie Ma, Wenling Zhou. 2026-10-20. Vanishing Uniform Turán Densities: Characterization and Jumps. https://arxiv.org/abs/2610.28574

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Domination polynomial of co-maximal graphs of integer modulo ring

We investigate the domination polynomial of the co-maximal graph $Γ(\mathbb{Z}_n)$ related to the ring of integers modulo $n$. Such a polynomial encodes domination sets of all possible sizes, a NP-hard problem for general graph. We give exact formulas for prime powers, integers with two distinct prime divisors, and products of three distinct primes. A prime-support decomposition gives a finite explicit formula for arbitrary $n$, including repeated prime factors. Further results determine the highest coefficients, the precise threshold beyond which every vertex subset dominates, and the number of non-dominating subsets. We discuss unimodality and log-concavity, and derive justified bounds for nonzero domination roots using the Eneström--Kakeya theorem.

math.CO↗

On gcd-graphs over matrix rings

Graphs defined over finite rings are well studied in the literature. The study of these graphs benefits from rich connections between several areas of mathematics, including number theory, algebra, combinatorics, and graph theory, and these connections often lead to interesting interactions between algebraic and combinatorial structures. In this article, we investigate gcd-graphs defined over matrix rings with coefficients in finite fields. We show that these graphs exhibit several interesting graph-theoretic properties. Along the way, we also prove some results on the structure of matrix rings, which may be of independent interest.

math.CO↗

A solution to a conjecture on the signless Laplacian spectral radius for $t$-color-critical graphs

An induced matching is a matching that forms an induced subgraph. A graph is $t$-color-critical if removing some induced matching of size $t$ lowers its chromatic number, but removing any $t-1$ vertices does not. Let $F$ be a $t$-color-critical graph with $χ(F)=r+1$. For sufficiently large $n$, Simonovits determined the unique edge-extremal $F$-free graph on $n$ vertices. Recently, Zheng, Li and Li [Linear Algebra Appl.\ 730 (2026) 546--565] conjectured that, for $t\ge 2$ and $r\ge 3$, the join $K_{t-1}\vee T_{n-t+1,r}$ uniquely maximizes the signless Laplacian spectral radius among all $n$-vertex $F$-free graphs when $n$ is sufficiently large. In this paper, we prove this conjecture. In contrast to the usual spectral arguments, our proof of this conjecture relies on two techniques of a rather different flavour. Our first technique is an analogue of Zykov symmetrization for the signless Laplacian matrix. Our second technique is an induction on $n$, from which we obtain the lower bound on the smallest entry of the Perron vector of a signless Laplacian spectral extremal graph rather than a structural statement.

math.CO↗