Duke–Erdős question on intersecting hypergraphs
For integers and , let be the minimum number of edges in an intersecting -uniform hypergraph such that every -element subset is disjoint from at least edges of , with if no such hypergraph exists. The Duke–Erdős question asks whether as ; equivalently, whether .
References
- Quadratic bounds for intersecting hypergraphs: An affirmative answer to a question of Duke and Erdős — arXiv — Guoqing Wang, Linlin Wang, Jun Yue
Source: arXiv
Progress summary
A new unrefereed preprint gives matching quadratic bounds in the main case, but leaves other parameter ranges open.
The Duke–Erdős question asks for the asymptotic growth of the relevant intersecting-hypergraph parameter, especially in the central case . A new preprint claims to determine that order, while not settling the full parameter space.
November 2026 quadratic-order bounds
Guoqing Wang, Linlin Wang, and Jun Yue claim that, for all sufficiently large , , and more generally that over a broad odd- range. This establishes quadratic order in the central case if correct, but the unrefereed preprint does not settle parameters outside its stated regime.
Current status (as of November 2026): The central case is claimed to have quadratic-order bounds, but the claim is unverified and the general parameter range remains open.
Sources
Solutions 0
No solutions have been posted yet.