Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Erdős–Rado_sunflower_lemma
|
| gptkbp:field |
combinatorics
|
| gptkbp:generalizes |
gptkb:Delta-system_lemma
|
| gptkbp:hasApplication |
circuit complexity
proof complexity data structure lower bounds |
| https://www.w3.org/2000/01/rdf-schema#label |
Sunflower lemma
|
| gptkbp:namedAfter |
gptkb:Paul_Erdős
gptkb:Richard_Rado |
| gptkbp:publishedIn |
gptkb:Journal_of_the_London_Mathematical_Society
|
| gptkbp:state |
A family of sets of size k with more than k!(r-1)^k sets contains a sunflower with r petals.
|
| gptkbp:usedIn |
gptkb:Ramsey_theory
gptkb:complexity_theory theoretical computer science extremal combinatorics |
| gptkbp:yearProposed |
1960
|
| gptkbp:bfsParent |
gptkb:Richard_Rado
|
| gptkbp:bfsLayer |
6
|