Another Note on Dilworth's Decomposition Theorem
Joint Authors
Source
Journal of Discrete Mathematics
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-4, 4 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-01-10
Country of Publication
Egypt
No. of Pages
4
Main Subjects
Information Technology and Computer Science
Abstract EN
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.
American Psychological Association (APA)
Pijls, Wim& Potharst, Rob. 2013. Another Note on Dilworth's Decomposition Theorem. Journal of Discrete Mathematics،Vol. 2013, no. 2013, pp.1-4.
https://search.emarefa.net/detail/BIM-491029
Modern Language Association (MLA)
Pijls, Wim& Potharst, Rob. Another Note on Dilworth's Decomposition Theorem. Journal of Discrete Mathematics No. 2013 (2013), pp.1-4.
https://search.emarefa.net/detail/BIM-491029
American Medical Association (AMA)
Pijls, Wim& Potharst, Rob. Another Note on Dilworth's Decomposition Theorem. Journal of Discrete Mathematics. 2013. Vol. 2013, no. 2013, pp.1-4.
https://search.emarefa.net/detail/BIM-491029
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-491029
