![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() |
Let be a finite Partially Ordered Set. A chain in
is a set of pairwise comparable elements (i.e., a
Totally Ordered subset). The Length of
is the maximum
Cardinality of a chain in
. For a Partial Order, the size of the longest chain is called the
Length.
See also Addition Chain, Antichain, Brauer Chain, Chain (Graph), Dilworth's Lemma, Hansen Chain