Optimizing diversity

Yannick Frein, Benjamin Lévêque, Andras Sebo

We consider the problem of minimizing the size of a family of sets 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 n a…