Length Of A Partially Ordered Set

From Encyclopediaofmath

2020 Mathematics Subject Classification: Primary: 06A [MSN][ZBL]

The greatest possible length of a chain (totally ordered subset) in a partially ordered set (the length of a finite chain is one less than the number of elements). There exist infinite partially ordered sets of finite length. A partially ordered set of length zero is a trivial order.

Dilworth's theorem [1] states that in a finite partially ordered set the length is equal to the minimal number of anti-chains (sets of mutually incomparable elements) that cover the set.

References[edit]

[1] R.P. Dilworth, "A decomposition theorem for partially ordered sets" Ann. of Math. , 51 (1950) pp. 161–166 Zbl 0038.02003
[2] George Grätzer, General Lattice Theory, Springer (2003) ISBN 3764369965 Zbl 1152.06300
↧ Download as ZWI file | Last modified: 01/07/2026 03:09:46 | 13 views
☰ Source: https://encyclopediaofmath.org/wiki/Length_of_a_partially_ordered_set | License: CC BY-SA 3.0

✘
ZWI is not signed. [what is this?]

ZWI viewer by the EncyclosphereKSF