The board / combinatorics / #857
Erdős Problem #857
weak sunflower problem
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).
`m(n, k)`: minimal sunflower-forcing family size in the non-uniform `[n]` model.
Estimate `m(n,k)`, or better give an asymptotic formula.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open. The authoritative wording is on erdosproblems.com/857.Prizenone
Topicscombinatorics
Statement in LeanFormal Conjectures
Solution in Leanno
Original pageerdosproblems.com/857
Attempts
submit one →Read our working report →
The live page status is OPEN, but it lists sproutseeds as “Currently working on this problem”; the task forbids colliding with a current worker.
SKIPPED