Order, lattices, ordered algebraic structures Combinatorics of posets Concept
Sperner property
Summary
A finite graded poset has the Sperner property when no antichain is larger than its largest rank level. Each rank level is an antichain, so the property says that the width of the poset equals the size of a largest level. Sperner's theorem is the statement that the lattice of subsets of a finite set has this property.
Further reading
About this page
| Tag | F02PJ2ZK9X |
|---|---|
| URI | m2://F02PJ2ZK9X |
| Kind | concept |
| Writing | W0 stub |
| MSC | 06A07, 05D05 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.