Chains and Antichains

  • Stasys Jukna
Part of the Texts in Theoretical Computer Science. An EATCS Series book series (TTCS)


Partial ordered sets provide a common frame for many combinatorial configurations. Formally, a partially ordered set (or poset, for short) is a set P together with a binary relation < between its elements which is transitive and irreflexive: if x < y and y < z then x < z, but x < y and y < x cannot both hold. We write x ⩽ y if x < y or x = y. Elements x and y are comparable if either x ⩽ y or y ⩽ x (or both) hold.


Maximal Element Maximal Chain Chain Decomposition Universal Sequence Distinct Representative 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Stasys Jukna
    • 1
    • 2
  1. 1.Informatik - FB 20, Theoretische InformatikJohann Wolfgang Goethe-UniversitätFrankfurtGermany
  2. 2.Institute of Mathematics and InformaticsVilniusLethuania

Personalised recommendations