Status
On this page
Status
Topics
Status
On this page
Status
Topics
Let . There exists such that, for any , if is sufficiently large, the following holds.
Any -uniform hypergraph on vertices with at least many edges contains a subgraph on vertices with at least edges, where as .
Source: erdosproblems.com/1075
A full solution has been claimed but not yet accepted. The statement is false.
Open on the site (label OPEN; page last edited 5 October 2025). The site's commentary records Erdős's theorem [Er64f] that the statement holds with for every hypergraph with at least edges, so the question is whether the constant can be raised above under the stronger density hypothesis. One full claim is pending: Gu's disproof (5 September 2026), explicit -uniform hypergraphs meant to show that no works, lifted to every ; the forum entry described an earlier -uniform version, whose Zenodo record was removed on 23 September 2026. It is not refereed and no outside reviewer has endorsed it, so the standing is claimed, not solved.