The Story of Sunflowers
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909795273932800 |
|---|---|
| author | Rao, Anup |
| author_facet | Rao, Anup |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_14790 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The Story of Sunflowers Rao, Anup Combinatorics 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. |
| title | The Story of Sunflowers |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2509.14790 |