scholarly journals Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth’s Theorem

2018 ◽  
Vol 14 (2) ◽  
pp. 1-26 ◽  
Author(s):  
Ademir Hujdurović ◽  
Edin Husić ◽  
Martin Milanić ◽  
Romeo Rizzi ◽  
Alexandru I. Tomescu
Keyword(s):  
Dilworth’S Theorem

On dilworth’s theorem in the in finite case

1963 ◽  
Vol 1 (2) ◽  
pp. 108-109 ◽  
Author(s):  
Micha A. Peles
Keyword(s):  
Finite Case ◽  
Dilworth’S Theorem

scholarly journals Another Note on Dilworth's Decomposition Theorem

2013 ◽  
Vol 2013 ◽  
pp. 1-4 ◽  
Author(s):  
Wim Pijls ◽  
Rob Potharst
Keyword(s):  
Decomposition Theorem ◽  
New Method ◽  
Flow Networks ◽  
Maximal Antichain ◽  
Dilworth’S Theorem

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.

An Extension of Dilworth's Theorem

1977 ◽  
Vol s2-16 (3) ◽  
pp. 393-396
Author(s):  
Julie A. Sims
Keyword(s):  
Dilworth’S Theorem
Sign in / Sign up

Export Citation Format

Share Document