Open AccessAnother Note on Dilworth's Decomposition Theorem
Author(s) -
Wim Pijls,
Rob Potharst
Publication year - 2013
Publication title -
journal of discrete mathematics
Language(s) - English
Resource type - Journals
eISSN - 2090-9837
pISSN - 2090-9845
DOI - 10.1155/2013/692645
Subject(s) - mathematics , antichain , decomposition theorem , decomposition , relation (database) , property (philosophy) , discrete mathematics , combinatorics , pure mathematics , computer science , partially ordered set , ecology , philosophy , epistemology , database , biology
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom