Packing and covering k-chain free subsets in Boolean lattices (Q1043999)

The hypergraph \(H(B_n)\) is defined whose vertices are the points of the Boolean lattice \(B_n\) and whose edges are inclusionwise maximal \(k\)-chain free subsets of \(B_n\). In the paper under review, the author finds asymptotic bounds for the covering number (the smallest number of vertices intersecting every hyperedge) and the packing number (the greatest number of pairwise disjoint hyperedges) of \(H(B_n)\). Estimations were so far known only for \(k=2\).