On the Number of Maximal Elements in a Partially Ordered Set

DOI10.4153/CMB-1987-050-6MaRDI QIDQ3030870zbMATH OpenOpenAlexFDO

Authors J. Ginsburg

Publication date 1987

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/cmb-1987-050-6

zbMATH Keywords

maximal chainmaximal elementsn-cutset propertyposet

Mathematics Subject Classification ID

Partial orders, general (06A06)

Recommendations

• On the n-cutset property
• Wide posets with fixed height and cutset number
• A length-width inequality for partially ordered sets with two-element cutsets
• A companion to Grillet's theorem on maximal chains and antichains
• Binary Trees and the n-Cutset Property

Cited in

(8)

• A length-width inequality for partially ordered sets with two-element cutsets
• On the n-cutset property
• On the dimension of ordered sets with the 2-cutset property
• On the poset of all posets on n elements
• On Supremal and Maximal Sets with Respect to Random Partial Orders
• scientific article; zbMATH DE number 5998889 (Why is no real title available?)
• Binary Trees and the n-Cutset Property
• Wide posets with fixed height and cutset number

This page was built for publication: On the Number of Maximal Elements in a Partially Ordered Set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3030870)