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 universality of graphs with uniformly distributed edges
2 Pith papers cite this work, alongside 95 external citations. Polarity classification is still indexing.
2
Pith papers citing it
95
external citations · Crossref
fields
math.CO 2representative citing papers
The paper shows π₁(S_k) equals (k²-5k+7)/(k-1)² for k≥9 by improving the optimality range of the palette construction.
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.