Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T18:39:41.154Z Has data issue: false hasContentIssue false

On the Number of Maximal Elements in a Partially Ordered Set

Published online by Cambridge University Press:  20 November 2018

John Ginsburg*
Affiliation:
The University of Winnipeg Winnipeg, Manitoba Canada R3B 2E9
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1987