Order, lattices, ordered algebraic structures Chains, antichains, dimension Concept
Width of a poset
Summary
The width of a partially ordered set is the largest size of an antichain in it. It measures how many elements can be pairwise incomparable at the same time. By Dilworth's theorem, for a finite poset it is also the least number of chains that cover the poset.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | RA5SQ908G1 |
|---|---|
| URI | m2://RA5SQ908G1 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 06A07 |
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.