On restricted intersections and the sunflower problem
From MaRDI portal
Abstract: A sunflower with petals is a collection of sets over a ground set such that every element in is in no set, every set, or exactly one set. ErdH{o}s and Rado cite{er} showed that a family of sets of size contains a sunflower if there are more than sets in the family. Alweiss et al. cite{alwz} and subsequently, Rao cite{rao} improved this bound to . We study the case where the pairwise intersections of the set family are restricted. In particular, we improve the best-known bound for set families when the size of the pairwise intersections of any two sets is in a set . We also present a new bound for the special case when the set is the nonnegative integers less than or equal to using the techniques of Alweiss et al. cite{alwz}.
Recommendations
Cites work
- Coding for Sunflowers
- Every large set of equidistant (0,+1,-1)-vectors forms a sunflower
- scientific article; zbMATH DE number 3414305 (Why is no real title available?)
- Improved bounds for the sunflower lemma
- Intersection Theorems for Systems of Sets
- Note on sunflowers
- Sunflowers and L-intersecting families
This page was built for publication: On restricted intersections and the sunflower problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6121916)