2011-04-27
Dilworth's Theorem Revisited, an Algorithmic Proof
Publication
Publication
Report / Econometric Institute, Erasmus University Rotterdam p. 1- 7
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.
| Additional Metadata | |
|---|---|
| Erasmus School of Economics | |
| hdl.handle.net/1765/23112 | |
| Econometric Institute Research Papers | |
| Report / Econometric Institute, Erasmus University Rotterdam | |
| Organisation | Erasmus School of Economics |
|
Pijls, W., & Potharst, R. (2011). Dilworth's Theorem Revisited, an Algorithmic Proof (No. EI 2011-13). Report / Econometric Institute, Erasmus University Rotterdam (pp. 1–7). Retrieved from http://hdl.handle.net/1765/23112 |
|
