research
Dilworth's Theorem Revisited, an Algorithmic Proof
- Publication date
- Publisher
Abstract
Dilworth's theorem establishes a link between a minimal path cover and a maximal antichain in a digraph.A new proof for Dilworth's theorem is given. Moreover an algorithm to find both the path cover and the antichain, as considered in the theorem, is presented.