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.
No takes yet. Share an insight, caveat, or question.
Pijls et al. (2013) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: