Hypergraphs with a Quarter Uniform Turán Density

Journal Article (2025)
Author(s)

Hao Li (Laboratoire Interdisciplinaire des Sciences du Numèrique)

H. Lin (TU Delft - Cyber Security)

Guang Hui Wang (Shandong University)

Wen Ling Zhou (Shandong University)

Research Group
Cyber Security
DOI related publication
https://doi.org/10.1007/s40305-025-00619-7
More Info
expand_more
Publication Year
2025
Language
English
Research Group
Cyber Security
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

The uniform Turán density πu(F) of a (3-uniform) hypergraph F is the supremum of d for which there are infinitely many F-free hypergraphs with the property that every induced subhypergraph of H on a linearly sized vertex set has edge density at least d. Determining πu(F) for given hypergraphs F was suggested by Erdős and Sós in the 1980s. However, there are very few hypergraphs whose uniform Turán density has been determined. In this paper, we are the first to establish a verifiable condition for hypergraphs F with πu(F)=1/4. In particular, currently known hypergraphs whose uniform Turán density is 1/4, such as K4(3)- studied in Glebov et al. (Israel J Math 211:349–366, 2016) and Reiher et al. (J Eur Math Soc 20:1139–1159, 2018), and F5⋆ studied in Chen and Schülke (Beyond the broken tetrahedron, 2022, arXiv:2211.12747), satisfy this condition. Moreover, we also identify some new hypergraphs whose uniform Turán density is also 1/4.

Files

S40305-025-00619-7.pdf
(pdf | 0.98 Mb)
License info not available
warning

File under embargo until 05-01-2026