Order, lattices, ordered algebraic structures Chains, antichains, dimension Concept
Graded poset
Summary
A graded poset is a partially ordered set with a rank function that goes up by exactly one along each covering step. The elements then fall into levels, like the floors of a building. Many posets of combinatorics are graded: subsets by size, divisors by the number of prime factors, partitions by their size.
Where this leads
3 pages build on this one.
Further reading
About this page
| Tag | 1C7TKGTB2F |
|---|---|
| URI | m2://1C7TKGTB2F |
| Kind | concept |
| Writing | W0 stub |
| MSC | 06A07 |
| 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.