Packing and covering k-chain free subsets in Boolean lattices
From MaRDI portal
Publication:1043999
DOI10.1016/j.disc.2009.01.022zbMath1200.05051MaRDI QIDQ1043999
Publication date: 10 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.01.022
11H31: Lattice packing and covering (number-theoretic aspects)
05B40: Combinatorial aspects of packing and covering
Cites Work
- Chains, antichains, and fibres
- Two-colouring all two-element maximal antichains
- Fibres and ordered set coloring
- A smallest-fibre-size to poset-size ratio approaching \({8 \over 15}\)
- A minimal cutset of the Boolean lattice with almost all members
- Fibres of width 3 ordered sets
- Minimum sized fibres in distributive lattices
- Maximal Chains and Antichains in Boolean Lattices
- Unnamed Item
- Unnamed Item
- Unnamed Item