Balogh–Clemen–Lidický's exact cell2cell_2-norm Turán conjecture for K53K_5^3

Let H\mathcal{H} be an rr-graph, and let dH(e)d_{\mathcal{H}}(e) denote the codegree of an (r−1)(r-1)-set ee. Define

∥H∥2=∑e∈(V(H)r−1)dH(e)2.\lVert\mathcal{H}\rVert_{2}=\sum_{e\in \binom{V(\mathcal{H})}{r-1}}d_{\mathcal{H}}(e)^2.

For an rr-graph H\mathcal{H}, let

exℓ2(n,F)=max⁡{∥H∥2:∣V(H)∣=n and H is F-free}.\mathrm{ex}_{\ell_2}(n,\mathcal F)=\max\{\lVert\mathcal H\rVert_2:|V(\mathcal H)|=n\text{ and }\mathcal H\text{ is }\mathcal F\text{-free}\}.

Given a balanced partition [n]=V1∪V2[n]=V_1\cup V_2, let Bn\mathbb{B}_n be the complete bipartite 33-graph consisting of all triples intersecting both parts. Balogh–Clemen–Lidický's conjecture. There exists n0n_0 such that for every n≥n0n\ge n_0,

exℓ2(n,K53)=∥Bn∥2,\mathrm{ex}_{\ell_2}(n,K_5^3)=\lVert\mathbb{B}_n\rVert_2,

and Bn\mathbb{B}_n is the unique K53K_5^3-free 33-graph on nn vertices attaining this value. The ell2ell_2-norm Turán density is already known to equal 5/85/8; the conjecture asks for the exact extremal value and uniqueness for all sufficiently large nn.

References

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).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.