Interval Packing and Covering in the Boolean Lattice
Konrad Engel · Combinatorics Probability Computing · 1996
Let be the hypergraph whose points are the subsets X of [n] := {1,…,n} with l≤ |X| ≤ u, l 0 the inequalities hold, where for the lower bounds we suppose that n is not too small. The corresponding fractional numbers can be determined exactly. Moreover, we show by construction that