Mubayi–Zhao's rational codegree Turán density conjecture for single hypergraphs

From papers

Let kk-graphs be kk-uniform hypergraphs, let β(F)\beta(F) denote the codegree Turán density of a kk-graph FF, and let β(ρ)\beta(\rho) denote the corresponding density for a family ρ\rho of kk-graphs. Mubayi–Zhao's conjecture. Fix k3k 3. For every rational number α[0,1)\alpha\in [0,1), there exists a kk-graph FF such that γ(F)=α\gamma(F)=\alpha. Only a few sporadic examples of 33-graphs with non-zero codegree Turán density are known, so the conjecture remains open; the preceding theorem establishes the analogous statement for finite families of kk-graphs.

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

Jun Gao, Oleg Pikhurko, Mingyuan Rong and Shumin Sun, “Rational codegree Turán density of hypergraphs”, arXiv:2601.00758 (2026).

Solutions 0

No solutions have been posted yet.