A minimal cutset of the Boolean lattice with almost all members
The authors consider cutsets in the lattice of subsets of a finite set, where cutting means intersecting all maximal chains. They show that there exist minimal cutsets containing a fraction arbitrarily close to 1 of all subsets. They start with the cutset associated with a partition of the total set into subsets \(S_ i\) consisting of all subsets which either contain a nonempty proper subset of every \(S_ i\) or contain all of some \(S_ i\), none of some \(S_ j\). Then by a probabilistic argument they show a small subset can be removed to make it minimal.
- Minimum cutsets for an element of a Boolean lattice
- Cutsets of Boolean lattices
- The density of a maximum minimal cut in the subset lattice of a finite set is almost one
- Minimum cutsets for an element of a subspace lattice over a finite vector space
- On the Minimum Width of a Cutset in the Truncated Boolean Lattice
- Packing and covering k-chain free subsets in Boolean lattices
- Cutsets of Boolean lattices
- Lattices of cuts in graphs
- Minimum cutsets for an element of a Boolean lattice
- 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
- Minimum sized fibres in distributive lattices
- Large Convex Cones in Hypercubes
- The finite cutset property
- Edge‐cutsets in the directed hypercube
- The growth constant of odd cutsets in high dimensions
- scientific article; zbMATH DE number 2230313 (Why is no real title available?)
- On the \(f\)-vectors of cutsets in the Boolean lattice
- LS sets as cohesive subsets of graphs and hypergraphs
- Cutsets and anti-chains in linear lattices
- Large convex cones in hypercubes
This page was built for publication: A minimal cutset of the Boolean lattice with almost all members
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1262863)
