A new palette framework reduces (k-2)-uniform Turán densities of k-graphs to palette-homomorphism problems and yields exact values including (r-1)/r, (r-1)^2/r^2, and (k-1)^k/k^k for various k and r.
On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs
1 Pith paper cite this work, alongside 16 external citations. Polarity classification is still indexing.
1
Pith paper citing it
16
external citations · Crossref
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Uniform Tur\'an densities of $k$-uniform hypergraphs
A new palette framework reduces (k-2)-uniform Turán densities of k-graphs to palette-homomorphism problems and yields exact values including (r-1)/r, (r-1)^2/r^2, and (k-1)^k/k^k for various k and r.