Another note on Dilworth's decomposition theorem. (Q2249932)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Another note on Dilworth's decomposition theorem. |
scientific article |
Statements
Another note on Dilworth's decomposition theorem. (English)
0 references
4 July 2014
0 references
Summary: This paper proposes a new proof of Dilworth's theorem. The proof is based upon the minflow/maxcut property in flow networks. In relation to this proof, a new method to find both a Dilworth decomposition and a maximal antichain is presented.
0 references
Dilworth decomposition theorem
0 references
posets
0 references
maximal antichains
0 references
minimal path covers
0 references
0 references
