Cutsets of Boolean lattices
type: Item
instance of: scholarly article
title: Cutsets of Boolean lattices
zbMATH Open document ID: 0608.06010
DOI: 10.1016/0012-365X(87)90011-2
published in: Discrete Mathematics
publication date: 1987-01-01T00:00:00Z
review text: If (P,\(\leq)\) is a finite ordered set and \(a\in P\), then \(F\subseteq P\) is a cutset for the element a, if (1) No element of F is comparable with a, (2) Every maximal chain of P intersects \(F\cup \{a\}\). In the article under review, the cardinalities of minimum sized cutsets associated with elements of finite Boolean algebras are determined.
Mathematics Subject Classification ID: 06E05
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 06A06
zbMATH DE Number: 3983237
zbMATH Keywords: finite ordered set
zbMATH Keywords: maximal chain
zbMATH Keywords: minimum sized cutsets
zbMATH Keywords: finite Boolean algebras
author: R. J. Nowakowski
MaRDI profile type: Publication
cites work: Q3050437
cites work: Compact Spaces and Spaces of Maximal Complete Subgraphs
cites work: Compactness and subsets of ordered sets that meet all maximal chains
cites work: Antichains and Finite Sets that Meet all Maximal Chains
cites work: Maximal chains and antichains
cites work: Antichain cutsets
cites work: Finite cutsets and finite antichains
full work available at URL: 0012-365x(87)90011-2
OpenAlex ID: W2082780656
description: scientific article; zbMATH DE number 3983237