Statements (12)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
intersecting families of sets
|
| gptkbp:field |
combinatorics
extremal set theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Hilton–Milner theorem
|
| gptkbp:namedAfter |
gptkb:Anthony_Hilton
gptkb:Eric_Milner |
| gptkbp:relatedTo |
gptkb:Erdős–Ko–Rado_theorem
|
| gptkbp:state |
the largest size of a nontrivial intersecting family of k-element subsets of an n-element set is C(n-1, k-1) - C(n-k-1, k-1) + 1 for n > 2k
|
| gptkbp:yearProved |
1967
|
| gptkbp:bfsParent |
gptkb:Erdős–Ko–Rado_theorem
|
| gptkbp:bfsLayer |
5
|