2025/09/18 by Rao, Anup · 2 citations
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2509.14790
Sunflowers, or Δ-systems, are a fundamental concept in combinatorics introduced by Erdős and Rado in their paper: \em Intersection theorems for systems of sets, J. Lond. Math. Soc. (1) \bf 35 (1960), 85--90. A sunflower is a collection of sets where all pairs have the same intersection. This paper explores the wide-ranging applications of sunflowers in computer science and combinatorics. We discuss recent progress towards the sunflower conjecture and present a short elementary proof of the best known bounds for the robust sunflower lemma.