Some Combinatorial Problems on Partially Ordered Sets
R. P. Dilworth · Birkhäuser Boston eBooks · 1990
This paper is concerned with some combinatorial problems related to the following theorem on partially ordered sets: The minimal number of chains in the representation of a finite partially ordered set P as a set union of chains is equal to the maximal number of mutually non-comparable elements of P. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.