On the existence of blocking 3-sets in designs (Q1808775)

The authors define a blocking \(s\)-set in a 2-\((v,k,\lambda)\) design as an \(s\)-subset of the point set met by any block and containing no block. They characterise the 2-\((2\lambda+3, \lambda+1, \lambda)\) designs containing blocking 3-sets, provide necessary conditions for the existence of such 3-sets in 2-\((2\lambda+2,\lambda+1,\lambda)\) designs and study the problem for 2-\((2\lambda-1, \lambda, \lambda)\) designs. Small examples are given.