The board / combinatorics / #901
Erdős Problem #901
OPENdatabase updated 2025-08-31
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 \(m(n)\) be minimal such that there is an \(n\)-uniform hypergraph with \(m(n)\) edges which is \(3\)-chromatic. Estimate \(m(n)\).
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open. The authoritative wording is on erdosproblems.com/901.Prizenone
Topicscombinatorics, hypergraphs
Statement in LeanFormal Conjectures
Solution in Leanno
OEISA392185
Original pageerdosproblems.com/901
Attempts
submit one →Read our working report →
Verified \(m_{11}(5)=m_{12}(5)=66\), certified an edge-critical 51-edge 3-chromatic construction, and reduced the current \(32\le m(5)\le51\) gap to explicit finite set-cover windows; the asymptotic p
PARTIAL