Minimum cutsets for an element of a Boolean lattice
From MaRDI portal
Recommendations
Cites work
- A short proof of Sperner's lemma
- Antichain cutsets
- Antichains and Finite Sets that Meet all Maximal Chains
- Compact Spaces and Spaces of Maximal Complete Subgraphs
- Convex hulls of more-part Sperner families
- Cutsets of Boolean lattices
- Finite cutsets and finite antichains
- Maximal chains and antichains
- Maximal Chains and Antichains in Boolean Lattices
- Ramsey-Sperner theory
Cited in
(10)- Cutsets of Boolean lattices
- A minimal cutset of the Boolean lattice with almost all members
- Minimum cutsets for an element of a subspace lattice over a finite vector space
- The density of a maximum minimal cut in the subset lattice of a finite set is almost one
- On uniform \(f\)-vectors of cutsets in the truncated Boolean lattice
- A family of inequalities for intersecting antichains of subsets of an \(n\)-set
- On the Minimum Width of a Cutset in the Truncated Boolean Lattice
- Edge‐cutsets in the directed hypercube
- scientific article; zbMATH DE number 2230313 (Why is no real title available?)
- On the \(f\)-vectors of cutsets in the Boolean lattice
This page was built for publication: Minimum cutsets for an element of a Boolean lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1264164)