Packing and covering k-chain free subsets in Boolean lattices

DOI10.1016/j.disc.2009.01.022zbMath1200.05051OpenAlexW2163424543MaRDI QIDQ1043999

Jia Shen

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

zbMATH Keywords

Boolean latticepacking numbercovering numbermaximal \(k\)-chain free subset

Mathematics Subject Classification ID

Lattice packing and covering (number-theoretic aspects) (11H31) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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