Coding for Sunflowers
Coding for sunflowers, Discrete Analysis 2020:2, 8 pp. The sunflower problem is an old problem of Erdős and Rado in extremal set theory. A _sunflower_ is defined to be a collection of sets $A_1,\dots,A_r$ such that if $B=\bigcap_{i=1}^rA_i$ is their intersection, then the sets $A_i\setminus B$ are...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Diamond Open Access Journals
|
| Series: | Discrete Analysis |
| Online Access: | http://discrete-analysis.scholasticahq.com/article/11887-coding-for-sunflowers.pdf |