Description
Title: Recent developments on the Sunflower conjecture
Abstract: A sunflower with p petals is a family of sets A_1,...,A_p
such that the intersections of all pairs of distinct sets are the
same. A famous conjecture in combinatorics, called the Sunflower
conjecture, asserts a bound on the maximum size of any family of
k-sets that does not contain a p-sunflower. We review some recent work
by Ellenberg-Gijswijt and Naslund-Swain that proves a weak variant of
this conjecture due to Erdos and Szemeredi.