๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The length, the width and the cutset-number of finite ordered sets

โœ Scribed by Mohamed El-Zahar; Norbert Sauer

Publisher
Springer Netherlands
Year
1985
Tongue
English
Weight
298 KB
Volume
2
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Extensions of ordered sets having the fi
Extensions of ordered sets having the finite cutset property
โœ John Ginsburg ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 892 KB

Let P be an ordered set. P is said to have the finite cutset property if for every x in P there is a finite set F of elements which are noncomparable to x such that every maximal chain in P meets {x} t.J F. It is well known that this property is equivalent to the space of maximal chains of P being c

The lattice of antichain cutsets of a pa
The lattice of antichain cutsets of a partially ordered set
โœ Gerhard Behrendt ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 125 KB

## Behrendt, G., The lattice of antichain cutsets of a partially ordered set, Discrete Mathematics 89 (1991) 201-202. Every finite lattice is isomorphic to the lattice of antichain cutsets of a finite partially ordered set whose chains have at most three elements. A subset A of a partially order