Maximal Chains and Antichains in Boolean Lattices
From MaRDI portal
Recommendations
Cited in
(28)- Antichains and completely separating systems -- a catalogue and applications
- Minimum cutsets for an element of a Boolean lattice
- A note on maximal antichains in ordered sets
- On the number of maximal antichains in Boolean lattices for \(n\) up to 7
- Fibres of width 3 ordered sets
- Boolean layer cakes
- Packing and covering k-chain free subsets in Boolean lattices
- Cutsets and anti-chains in linear lattices
- A smallest-fibre-size to poset-size ratio approaching \({8 \over 15}\)
- Minimum sized fibres in distributive lattices
- Multicolor chain avoidance in the Boolean lattice
- Fibres and ordered set coloring
- Optimal Sets of Questions for Twenty Questions
- Two-colouring all two-element maximal antichains
- Edge‐cutsets in the directed hypercube
- Games of chains and cutsets in the Boolean lattice. II
- Every cutset meets every fibre in certain poset products
- Posets in which every cutset meets every fibre
- Subgraph transversal of graphs
- Cutsets of Boolean lattices
- scientific article; zbMATH DE number 3952833 (Why is no real title available?)
- On the size of maximal chains and the number of pairwise disjoint maximal antichains
- On Intersecting Chains in Boolean Algebras
- Chains, antichains, and fibres
- Maximal chains and cutsets of an ordered set: A Menger type approach
- scientific article; zbMATH DE number 2230313 (Why is no real title available?)
- Venn diagrams and symmetric chain decompositions in the Boolean lattice
- On the \(f\)-vectors of cutsets in the Boolean lattice
This page was built for publication: Maximal Chains and Antichains in Boolean Lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3483322)
