Geodesic
On the Number of Maximal Elements in a Partially Ordered Set
Canadian mathematical bulletin, Tome 30 (1987) no. 3, pp. 351-357

Voir la notice de l'article provenant de la source Cambridge University Press

Let P be a partially ordered set. For an element x ∊ P, a subset C of P is called a cutset for x in P if every element of C is noncomparable to x and every maximal chain in P meets {x} ∪ C. The following result is established: if every element of P has a cutset having n or fewer elements, then P has at most 2n maximal elements. It follows that, if some element of P covers k elements of P then there is an element x ∊ P such that every cutset for x in P has at least log2k elements.
DOI : 10.4153/CMB-1987-050-6
Mots-clés : 06A10, Partially ordered set, cutset, maximal element 
Ginsburg, John. On the Number of Maximal Elements in a Partially Ordered Set. Canadian mathematical bulletin, Tome 30 (1987) no. 3, pp. 351-357. doi: 10.4153/CMB-1987-050-6
@article{10_4153_CMB_1987_050_6,
     author = {Ginsburg, John},
     title = {On the {Number} of {Maximal} {Elements} in a {Partially} {Ordered} {Set}},
     journal = {Canadian mathematical bulletin},
     pages = {351--357},
     year = {1987},
     volume = {30},
     number = {3},
     doi = {10.4153/CMB-1987-050-6},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1987-050-6/}
}
TY  - JOUR
AU  - Ginsburg, John
TI  - On the Number of Maximal Elements in a Partially Ordered Set
JO  - Canadian mathematical bulletin
PY  - 1987
SP  - 351
EP  - 357
VL  - 30
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1987-050-6/
DO  - 10.4153/CMB-1987-050-6
ID  - 10_4153_CMB_1987_050_6
ER  - 
%0 Journal Article
%A Ginsburg, John
%T On the Number of Maximal Elements in a Partially Ordered Set
%J Canadian mathematical bulletin
%D 1987
%P 351-357
%V 30
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1987-050-6/
%R 10.4153/CMB-1987-050-6
%F 10_4153_CMB_1987_050_6

[1] 1. Erdos, P. and Rado, R., A partition calculus in set theory, Bull. Amer. Math. Soc. 62 (1956), pp. 427–489. Google Scholar

[2] 2. Ginsburg, J. and Sands, B., A length-width inequality for partially ordered sets with two-element cutsets, to appear. Google Scholar

[3] 3. Nowakowski, R., Cutsets of Boolean lattices, Discrete Math. 63 2, 3 (1987), pp. 231–240. Google Scholar

[4] 4. Rival, I. and Zaguia, N., Antichain cutsets, Order Vol. 1, No. 2 (1985), pp. 235–247. Google Scholar

[5] 5. Sauer, N., to appear. Google Scholar

[6] 6. Sauer, N. and Woodrow, R., Finite cutsets and finite antichains, Order Vol. 1, No. 1 (1984), pp. 35—46. Google Scholar

[7] 7. Sauer, N. and El Zahar, M., The length, the width and the cutset number of finite ordered sets, Order Vol. 2 No. 3 (1985), pp. 243–248. Google Scholar

Cité par Sources :