Mubayi–Zhao's rational codegree Turán density conjecture for single hypergraphs
Mubayi–Zhao's rational codegree Turán density conjecture for single hypergraphs
Let -graphs be -uniform hypergraphs, let denote the codegree Turán density of a -graph , and let denote the corresponding density for a family of -graphs. Mubayi–Zhao's conjecture. Fix . For every rational number , there exists a -graph such that . Only a few sporadic examples of -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 -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
Sign in to submit a solution.
No solutions have been posted yet.