A chain decomposition theorem
type: Item
instance of: scholarly article
title: A chain decomposition theorem
zbMATH Open document ID: 0656.06002
DOI: 10.1016/0097-3165(88)90075-1
published in: Journal of Combinatorial Theory. Series A
publication date: 1988-01-01T00:00:00Z
review text: The author proves that a poset (1) such that every point together with a finite set of elements incomparable with it form a cutset and (2) such that any bounded countable chain has sup and inf is the union of countably many chains. The proof uses the height of a poset of 2 element chains.
Mathematics Subject Classification ID: 06A06
zbMATH DE Number: 4070965
zbMATH Keywords: finite cutset property
zbMATH Keywords: Chain decomposition of posets
zbMATH Keywords: sigma-chain complete poset
author: Stevo Todorčević
reviewed by: Ki Hang Kim
MaRDI profile type: Publication
full work available at URL: 0097-3165(88)90075-1
OpenAlex ID: W2080610875
cites work: Compact Spaces and Spaces of Maximal Complete Subgraphs
cites work: Q3874266
cites work: A decomposition theorem for partially ordered sets
cites work: A partition calculus in set theory
cites work: Theory of relations. Transl. from the French by P. Clote
cites work: Antichains and Finite Sets that Meet all Maximal Chains
cites work: Compactness and subsets of ordered sets that meet all maximal chains
cites work: Extensions of ordered sets having the finite cutset property
cites work: Maximal chains and antichains
cites work: The Cofinality of a Partially Ordered Set
cites work: On Dilworth's theorem in the infinite case
cites work: Finite cutsets and finite antichains
cites work: Directed Sets and Cofinal Types
cites work: Q3726173
description: scientific article; zbMATH DE number 4070965