ISSN:
1572-9273
Keywords:
06A10
;
Ordered set
;
chain
;
antichains
;
width
;
cutset
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract 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} ∪ 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 some maximal antichain of cardinality less than n. We specify n for m 〈 w. Indeed, n-1=m= width P for m=1,2,n=5 if m=3 and n⩾ℵ1 if m ≥4. With the added hypothesis that every bounded chain has a supremum and infimum in P, it is shown that for 4⩽m⩽ℵ0, n=ℵ0. That is, if each element x has a finite cutset Fx, each element belongs to a finite maximal antichain.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00396272
Permalink