The codegree-squared density conjecture for
The codegree-squared density conjecture for
Let be the -uniform hypergraph on five vertices with five edges. The matrix construction described in the text gives
The codegree-squared density conjecture for . The lower bound is tight:
The lower bound comes from the construction and the upper bound from flag algebras; the supplied text does not resolve whether equality holds.
Sources & referencesView supporting material
Primary source
József Balogh, Felix Christian Clemen and Bernard Lidický, “Hypergraph Turán Problems in _2-Norm”, arXiv:2108.10406 (2025).
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
Sign in to submit a solution.
No solutions have been posted yet.