Cutsets of Boolean lattices
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.
scientific article; zbMATH DE number 3983237