Improved bounds for the sunflower lemma

Ryan Alweiss
Ryan Alweiss
Kewen Wu
Kewen Wu
Jiapeng Zhang
Jiapeng Zhang

STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing Chicago IL USA June, 2020, pp. 624-630, 2020.

Cited by: 9|Bibtex|Views11|Links
EI

Abstract:

A sunflower with r petals is a collection of r sets so that the intersection of each pair is equal to the intersection of all. Erdős and Rado proved the sunflower lemma: for any fixed r, any family of sets of size w, with at least about ww sets, must contain a sunflower. The famous sunflower conjecture is that the bound on the number of s...More

Code:

Data:

Your rating :
0

 

Tags
Comments