Abstract
A short proof of the following theorem is given: Let P be a finite partially ordered set. If the maximal number of elements in an independent subset of P is k, then P is the union of k chains.
| Original language | English |
|---|---|
| Pages (from-to) | 105-107 |
| Number of pages | 3 |
| Journal | Israel Journal of Mathematics |
| Volume | 1 |
| Issue number | 2 |
| DOIs | |
| State | Published - Jun 1963 |
Fingerprint
Dive into the research topics of 'A proof of dilworth's decomposition theorem for partially ordered sets'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver