An ordered set (P, <) has the m cutset property if for each x there is a set Fx with cardinality less than m, such that each element of Fx is incomparable to x and {x) u Fx meets every maximal chain of (P, <). Let n be least, such that each element x of any P having the m cutset property belongs to
Antichain cutsets
β Scribed by Ivan Rival; Nejib Zaguia
- Publisher
- Springer Netherlands
- Year
- 1985
- Tongue
- English
- Weight
- 523 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0167-8094
No coin nor oath required. For personal study only.
β¦ Synopsis
A subset A of an ordered set P is a cutset if each maximal chain of P meetsA ; if, in addition, A is an antichain call it an antichain cutset. Our principal result is a characterization, by means of a 'forbidden configuration', of those finite ordered sets, which can be expressed as the union of antichain cutsets. AMS (MOS) subject classification (1980). 06A10.
π SIMILAR VOLUMES
## 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