Improved bounds for the sunflower lemma

Ryan Alweiss
Kewen Wu
Jiapeng Zhang

Electronic Colloquium on Computational Complexity (ECCC), pp. 1102019.

Cited by: 9|Bibtex|Views17|
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\H{o}s and Rado proved the sunflower lemma: for any fixed \$r\$, any family of sets of size \$w\$, with at least about \$w^w\$ sets, must contain a sunflower. The famous sunflower conjecture is that the bound o...More

Code:

Data: