Confirms uniqueness of balanced bipartite extremal for ℓ₂ Turán on K₅³ and exact clique count in K₅³-free 3-graphs for large n via vertex-colored Turán theorems and local modifications.
GeneralizedTuránproblemforcompletehypergraphs.arXiv preprint arXiv:2302.07571,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Vertex-colored Tur\'{a}n theorems with applications in extremal hypergraph problems
Confirms uniqueness of balanced bipartite extremal for ℓ₂ Turán on K₅³ and exact clique count in K₅³-free 3-graphs for large n via vertex-colored Turán theorems and local modifications.