The board / hypergraphs / #1157
Erdős Problem #1157
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 \(s,k,r\geq 2\). Let \(\mathcal{F}\) be the family of all \(r\)-uniform hypergraphs with \(k\) vertices and \(s\) edges. Determine \[\mathrm{ex}_r(n,\mathcal{F}).\]
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open. The authoritative wording is on erdosproblems.com/1157.Prizenone
Topicshypergraphs, turan number
Statement in LeanFormal Conjectures
Solution in Leanno
Original pageerdosproblems.com/1157
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.