Abstract
A sunflower with r petals is a collection of r sets over a ground set X such that every element in X is in no set, every set, or exactly one set. Erdős and Rado [5] showed that a family of sets of size n contains a sunflower if there are more than \(n!(r-1)^n\) sets in the family. Alweiss et al. [1] and subsequently, Rao [7] and Bell et al. [2] improved this bound to \((O(r \log n))^n\). 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 L. We also present a new bound for the special case when the set L is the nonnegative integers less than or equal to d using the techniques of Alweiss et al. [1].
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alweiss, R., Lovett, S., Wu, K., Zhang, J.: Improved bounds for the sunflower lemma. Ann. Math. (2) 194(3), 795–815 (2021)
Bell, T., Chueluecha, S., Warnke, L.: Note on sunflowers. Discrete Math. 344(7), 112367 (2021)
Deza, M.: Solution d’un problème de Erdős-Lovász, J. Comb. Theory, Ser. B 16 (2), 1974, 166-167
Deza, M., Frankl, P.: Every large set of equidistant \((0,+1,-1)\)-vectors forms a sunflower. Combinatorica 1(3), 225–231 (1981)
Erdős, P., Rado, R.: Intersection theorems for systems of sets. J. Lond. Math. Soc. 35(1), 85–90 (1960)
Hegedűs, G.: Sunflowers and \(L\)-intersecting families. AKCE Int. J. Graphs Combinatorics 17(1), 402–406 (2019)
Rao, A.: Coding for Sunflowers, Discrete Analysis :2 (2020)
Acknowledgements
We thank Ryan Alweiss, Noga Alon, Robert Sedgewick, and Stephen Melczer for helpful suggestions, and to Lutz Warnke for telling us about [2].
Funding
Thank you to The Fifty Five Fund for Senior Thesis Research (Class 1955) Fund, Princeton University, for partially supporting this research.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors have no relevant financial or non-financial interests to disclose.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Chizewer, J. On Restricted Intersections and the Sunflower Problem. Graphs and Combinatorics 40, 31 (2024). https://doi.org/10.1007/s00373-024-02760-1
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00373-024-02760-1