Template-Type: ReDIF-Paper 1.0
Author-Name: Pijls, W.H.L.M.
Author-Name-Last: Pijls
Author-Name-First: Wim
Author-Name: Potharst, R.
Author-Name-Last: Potharst
Author-Name-First: Rob
Title: Dilworth's Theorem Revisited, an Algorithmic Proof
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.
Creation-Date: 2011-04-27
File-URL: https://repub.eur.nl/pub/23112/EI2011-13.pdf
File-Format: application/pdf
Series: RePEc:ems:eureir
Number: EI 2011-13
Handle: RePEc:ems:eureir:23112