Abstract:a b s t r a c tLet P be a finite poset. A subset of P is called k-element chain free if it contains no k-element chain. Let H (B n ) be the hypergraph whose vertices are the points of the Boolean lattice B n , and whose edges are inclusionwise maximal k-chain free subsets of B n . We investigate the covering number τ k (B n ) of H, i.e. the least number of points intersecting every maximal k-chain free subset of B n , and the packing (matching) number ν k (B n ) of H , i.e. the greatest number of pairwise disj… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.