On the dimension of ordered sets with the 2-cutset property
type: Item
instance of: scholarly article
title: On the dimension of ordered sets with the 2-cutset property
zbMATH Open document ID: 0789.06001
DOI: 10.1007/BF01108707
author: J. Ginsburg
published in: Order
publication date: 1994-01-13T00:00:00Z
review text: A subset of an ordered set \(P\) is called a cutset for \(P\) if it intersects every maximal chain of \(P\). If for every element \(x\in P\) there exists a subset \(S\) of \(P\), \(| S|\leq n\) (\(n\) a nonnegative integer), the elements of which are noncomparable to \(x\) and \(\{x\}\cup S\) is a cutset for \(P\), then \(P\) is said to have the \(n\)-cutset property. The core of this article consists in investigations of the case \(n=2\) and the dimension of \(P\). It is shown that the dimension for ordered sets with the 2-cutset property is bounded by a nonnegative integer \(N\). An example of an ordered set with the 2-cutset property with dimension 4 is given. At present, it is the largest known dimension for these ordered sets. Another interesting result is the statement that each ordered set \(P\) with the 2-cutset property can be expressed as \(P= X\cup Y\), where \(X\) is an ordinal sum of intervals of \(P\) having dimension \(\leq 9\), and \(Y\) is a subset of \(P\) with the largest size of an antichain \(\leq 16\).
Mathematics Subject Classification ID: 06A06
zbMATH DE Number: 484784
zbMATH Keywords: chain
zbMATH Keywords: \(n\)-cutset property
zbMATH Keywords: dimension
zbMATH Keywords: 2-cutset property
zbMATH Keywords: ordinal sum of intervals
zbMATH Keywords: antichain
reviewed by: Ladislav Skula
MaRDI profile type: Publication
cites work: Binary Trees and the n-Cutset Property
cites work: A decomposition theorem for partially ordered sets
cites work: Ladders in ordered sets
cites work: A length-width inequality for partially ordered sets with two-element cutsets
cites work: On the Number of Maximal Elements in a Partially Ordered Set
cites work: On the n-cutset property
cites work: Antichains and Finite Sets that Meet all Maximal Chains
cites work: Cutsets of Boolean lattices
cites work: Antichain cutsets
cites work: Cores, cutsets and the fixed point property
cites work: The length, the width and the cutset-number of finite ordered sets
cites work: Finite cutsets and finite antichains
cites work: Wide posets with fixed height and cutset number
full work available at URL: https://doi.org/10.1007/bf01108707
OpenAlex ID: W1974276274
description: scientific article; zbMATH DE number 484784