Hypergraphs with uniform Turán density equal to 8/27
Combinatorics, Probability and Computing · 2026-03 · 35 (2) · 280-289
DOI: 10.1017/s0963548325100308 ↗Kurz gefasst
Fachartikel in der Zeitschrift Combinatorics, Probability and Computing, online erschienen am 17.12.2025. Verfasst von Frederik Garbe und 4 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 27 Literaturangaben.
Abstract (Originalsprache)
In the 1980s, Erdős and Sós initiated the study of Turán problems with a uniformity condition on the distribution of edges: the uniform Turán density of a hypergraph $H$ is the infimum over all $d$ for which any sufficiently large hypergraph with the property that all its linear-size subhypergraphs have density at least $d$ contains $H$ . In particular, they asked to determine the uniform Turán densities of $K_4^{(3)-}$ and $K_4^{(3)}$ . After more than 30 years, the former was solved in [Israel J. Math. 211 (2016), 349 – 366] and [J. Eur. Math. Soc. 20 (2018), 1139 – 1159], while the latter still remains open. Till today, there are known constructions of $3$ -uniform hypergraphs with uniform Turán density equal to $0$ , $1/27$ , $4/27$ , and $1/4$ only. We extend this list by a fifth value: we prove an easy to verify sufficient condition for the uniform Turán density to be equal to $8/27$ and identify hypergraphs satisfying this condition.
Zitieren
APA
Garbe, F., Il’kovič, D., Kráľ, D., Kučerák, F., & Lamaison, A. (2026). Hypergraphs with uniform Turán density equal to 8/27. Combinatorics, Probability and Computing, 35(2), 280-289. https://doi.org/10.1017/s0963548325100308
Vancouver
Garbe F, Il’kovič D, Kráľ D, Kučerák F, Lamaison A. Hypergraphs with uniform Turán density equal to 8/27. Combinatorics, Probability and Computing. 2026;35(2):280-289. doi:10.1017/s0963548325100308
BibTeX
@article{Garbe2026,
author = {Garbe, Frederik and Il’kovič, Daniel and Kráľ, Daniel and Kučerák, Filip and Lamaison, Ander},
title = {Hypergraphs with uniform Turán density equal to 8/27},
journal = {Combinatorics, Probability and Computing},
year = {2026},
volume = {35},
number = {2},
pages = {280--289},
doi = {10.1017/s0963548325100308}
}
EUVIMED