Another Note on Dilworth's Decomposition Theorem
Keyword(s):
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.
2018 ◽
2020 ◽
Vol 1
(1)
◽
pp. 121-134
Keyword(s):
1980 ◽
Vol 21
(1)
◽
pp. 19-22
◽
1968 ◽
Vol 26
◽
pp. 98-99
Keyword(s):
1997 ◽
Vol 103
(1)
◽
pp. 219
2008 ◽
Vol 2008
◽
pp. 19-21
Keyword(s):
Keyword(s):