Mubayi–Zhao conjecture on codegree Turán densities
For every integer and every , there exists an infinite family of -uniform hypergraphs such that , while for every finite subfamily one has .
References
- The ℓ-degree Turán densities of hypergraphs: infinite families and their finite subfamilies — arXiv — Hao Lin, Wenling Zhou
Source: arXiv
Progress summary
A new unrefereed preprint claims the conjectured infinite-family result in the higher-codegree range, but the broader conjecture remains open.
Mubayi and Zhao initiated the codegree-density problem in 2007. Their conjecture predicts infinite forbidden families with prescribed density while every finite subfamily has larger density, and would imply that all values in occur.
Known results
- Mubayi and Zhao (2007): for , no value in is a -jump, so finite-family codegree densities are dense.
- Gao, Pikhurko, Rong, and Sun (January 5, 2026): every rational is realized by a finite family of -graphs for .
- The same work proves non-principality: .
October 13, 2026 higher-codegree preprint
Hao Lin and Wenling Zhou claim that for every and , an infinite family has -degree Turán density , while every finite subfamily has larger density; they also claim to answer the related Lo–Markström question. This is a substantial advance, but it is an unrefereed claim and does not cover every parameter range of the broader conjecture.
Current status (as of October 2026): The higher-codegree range is claimed in a new preprint, while the broader Mubayi–Zhao conjecture remains open and the claim is unverified.
Solutions 0
No solutions have been posted yet.