Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
Boolean lattice
|
| gptkbp:category |
theorems in combinatorics
|
| gptkbp:concerns |
antichains
partially ordered sets subsets |
| gptkbp:field |
combinatorics
|
| https://www.w3.org/2000/01/rdf-schema#label |
Sperner's theorem
|
| gptkbp:namedAfter |
gptkb:Emanuel_Sperner
|
| gptkbp:relatedTo |
gptkb:Erdős–Ko–Rado_theorem
gptkb:Dilworth's_theorem |
| gptkbp:sentence |
The largest size of a family of subsets of an n-element set, none of which contains another, is the binomial coefficient n choose floor(n/2).
|
| gptkbp:yearProved |
1928
|
| gptkbp:bfsParent |
gptkb:Sperner_theory
|
| gptkbp:bfsLayer |
7
|