Minimum cutsets for an element of a Boolean lattice
type: Item
instance of: scholarly article
title: Minimum cutsets for an element of a Boolean lattice
zbMATH Open document ID: 0689.06010
DOI: 10.1007/BF00341634
author: Daniel J. Kleitman
author: J. Griggs
published in: Order
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 06E05
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 06A06
zbMATH DE Number: 4128867
zbMATH Keywords: Lubell's inequality for antichains
zbMATH Keywords: minimum cutsets
MaRDI profile type: Publication
cites work: Compact Spaces and Spaces of Maximal Complete Subgraphs
cites work: Maximal Chains and Antichains in Boolean Lattices
cites work: Convex hulls of more-part Sperner families
cites work: Ramsey-Sperner theory
cites work: Maximal chains and antichains
cites work: Antichains and Finite Sets that Meet all Maximal Chains
cites work: A short proof of Sperner's lemma
cites work: Cutsets of Boolean lattices
cites work: Antichain cutsets
cites work: Finite cutsets and finite antichains
full work available at URL: https://doi.org/10.1007/bf00341634
OpenAlex ID: W2002378267
description: scientific article; zbMATH DE number 4128867