Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
finite sets
k-uniform set families |
| gptkbp:field |
combinatorics
|
| https://www.w3.org/2000/01/rdf-schema#label |
Erdős–Ko–Rado theorem
|
| gptkbp:influenced |
intersection theorems
|
| gptkbp:namedAfter |
gptkb:Paul_Erdős
gptkb:Richard_Rado gptkb:Chao_Ko |
| gptkbp:provenBy |
gptkb:Paul_Erdős
gptkb:Richard_Rado gptkb:Chao_Ko |
| gptkbp:publicationYear |
1961
|
| gptkbp:relatedTo |
gptkb:Erdős–Chao–Ko–Rado_theorem
gptkb:Frankl–Wilson_theorem gptkb:Hilton–Milner_theorem |
| gptkbp:state |
For n ≥ 2k, the largest intersecting family of k-element subsets of an n-element set has size C(n-1, k-1).
|
| gptkbp:topic |
intersecting families
set systems |
| gptkbp:yearProved |
1938
|
| gptkbp:bfsParent |
gptkb:Paul_Erdős
|
| gptkbp:bfsLayer |
4
|