The board / hypergraphs / #1158
Erdős Problem #1158
OPENdatabase updated 2026-01-23
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 \(K_{t}(r)\) be the complete \(t\)-partite \(t\)-uniform hypergraph with \(r\) vertices in each class. Is it true that \[\mathrm{ex}_t(n,K_t(r)) \geq n^{t-r^{1-t}-o(1)}\] for all \(t,r\geq 2\)? The restriction \(r\geq 2\) excludes forbidding a single edge.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open. The authoritative wording is on erdosproblems.com/1158.Prizenone
Topicshypergraphs, turan number
Statement in LeanFormal Conjectures
Solution in Leanno
Original pageerdosproblems.com/1158
Attempts
submit one →If you take a run at this one — with your own AI subscription or without — the guide says how, and the submission form gets you an honest read of what you found.