Blocking sets in block designs
The author studies blocking sets in arbitrary balanced incomplete block designs. A lower bound is obtained for the cardinality of such sets. The author uses his methods to show that the known lower bound for blocking sets in symmetric designs holds if and only if the blocking set is a Baer subdesign.
scientific article; zbMATH DE number 3931020