book chapterBirkhäuser Boston eBooksJan 1, 2009Closed access

A Decomposition Theorem for Partially Ordered Sets

RPR. P. Dilworth

California Institute of Technology · Yale University

Indexed incrossref

Abstract

Otherwise a and b are non-comparable. A subset S of P is independent if every two distinct elements of S are non-comparable. S is dependent if it contains two distinct elements which are comparable. A subset C of P is a chain if every two of its elements are comparable.

Citation impact

1,010
total citations
FWCI
48.22
Percentile
100%
References
3
Citations per year

Authors

1

Topics & keywords

Topics
Keywords
  • Decomposition
  • Mathematics
  • Combinatorics
  • Chain (unit)
  • Decomposition theorem
  • Discrete mathematics
  • Chemistry
  • Physics
No related works found for this paper.