Discrete MathematicsVolume 15, Issue 3, 1976, Pages 301-304On Dilworth's decomposition theoremAuthor links open overlay panelHayo Oellrich, Karsten SteffensShow moreShareCitehttps://doi.org/10.1016/0012-365X(76)90032-7Get rights and contentUnder an Elsevier user licenseopen archiveAbstractFor every countable po set P without infinite chains there exists a partition (Cj: jϵI) of P into pairwise disjoint chains and an antichain A such that Cj∩A≠Ø for every iϵI.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1976 Published by Elsevier B.V.