Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T17:40:00.304Z Has data issue: false hasContentIssue false

The 3-Irreducible Partially Ordered Sets

Published online by Cambridge University Press:  20 November 2018

David Kelly*
Affiliation:
University of Manitoba, Winnipeg, Manitoba
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.

The dimension [4] of a partially ordered set (poset) is the minimum number of linear orders whose intersection is the partial ordering of the poset. For a positive integer m, a poset is m-irreducible[10] if it has dimension m and removal of any element lowers its dimension. By the compactness property of finite dimension, every m-irreducible poset is finite and every poset of dimension ≧ m contains an m-irreducible subposet.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1977