103
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We consider the problem of minimizing the size of a set system G such that every subset of {1, . . . , n} can be written as a disjoint union of at most k members of G, where k and...