Balogh–Clemen–Lidický's exact -norm Turán conjecture for
Balogh–Clemen–Lidický's exact -norm Turán conjecture for
Let be an -graph, and let denote the codegree of an -set . Define
For an -graph , let
Given a balanced partition , let be the complete bipartite -graph consisting of all triples intersecting both parts. Balogh–Clemen–Lidický's conjecture. There exists such that for every ,
and is the unique -free -graph on vertices attaining this value. The -norm Turán density is already known to equal ; the conjecture asks for the exact extremal value and uniqueness for all sufficiently large .
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Wanfang Chen, Jinghua Deng, Jianfeng Hou, Xizhi Liu and Yixiao Zhang, “Vertex-colored Turán theorems with applications in extremal hypergraph problems”, arXiv:2606.02210 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.