Exact Turán densities of hypergraphs
Determine the exact Turán density \(\pi(F)\) for arbitrary \(k\)-uniform hypergraphs \(F\) with \(k\geq 3\).
References
Determining the value of~$\pi(F)$ for~$k$-graphs (with~$k\geq 3$) is one of the central open problems in combinatorics.
— Infinitely many accumulation points of codegree Turán densities
(2502.13485 - Li et al., 19 Feb 2025) in Introduction
It is not known whether 2/kk is the first accumulation point above k{-k} for single forbidden k-graphs, or whether exact densities can converge to k{-k} from above.
— Coordinate-extension degrees and layered $k$-uniform hypergraphs
(2610.03347 - Yang, 2 Oct 2026) in Section 6, Concluding remarks