The board / hypergraphs / #1075
Erdős Problem #1075
OPENdatabase updated 2025-10-05
No proof or disproof is known, and it isn't known whether a finite computation could settle it.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
Let \(r\geq 3\). There exists \(c_r>r^{-r}\) such that, for any \(\epsilon>0\), if \(n\) is sufficiently large, the following holds. Any \(r\)-uniform hypergraph on \(n\) vertices with at least \((1+\epsilon)(n/r)^r\) many edges contains a subgraph on \(m\) vertices with at least \(c_rm^r\) edges, where \(m=m(n)\to \infty\) as \(n\to \infty\).
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open. The authoritative wording is on erdosproblems.com/1075.Prizenone
Topicshypergraphs
Statement in LeanFormal Conjectures
Solution in Leanno
Original pageerdosproblems.com/1075
Attempts
submit one →Read our working report →
Live page status OPEN (0 claimed proofs), but “Currently working on this problem” lists dumbprime; stopped before attempting mathematics to avoid colliding with the current worker.
SKIPPED