Covering \(t\)-element sets by partitions (Q1180794): Difference between revisions

A partition of a set is a decomposition of the set into pairwise disjoint subsets, called blocks. Partitions of a set form a \(t\)-cover if each \(t\)- element subset of the set is covered by at least one block. The rank of a \(t\)-cover is the maximum blocksize appearing in the partitions. They more or less are a natural generalization of blocking sets. In this nicely written and interesting paper the authors derive lower bounds on the rank of a \(t\)-cover and they show that in a lot of cases this bound is sharp.