Optimal linear extensions by interchanging chains

  • Rival I
  • 5


    Mendeley users who have this article in their library.
  • 56


    Citations of this article.


The most fundamental and yet far-reaching results in the theory of ordered sets are the following: (RP Dilworth [1950]) In a finite ordered set P, the minimum number of disjoint chains whose set union is all of P equals the maximum number of pairwise noncompara- ble ...

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • I Rival

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free