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.
Tetrahedron conjecture in theℓ2-norm.arXiv preprint arXiv:2511.12506, 2025
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Determines the maximum number of t-cliques in n-vertex r-graphs with bounded (j,p)-norm when p>(t-j)/(r-j), proved via entropy plus interpolation and sharp for Steiner systems.
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.
-
On cliques in hypergraphs under bounded $(j,p)$-norm
Determines the maximum number of t-cliques in n-vertex r-graphs with bounded (j,p)-norm when p>(t-j)/(r-j), proved via entropy plus interpolation and sharp for Steiner systems.