Improved conditions for the robustness of binary block designs against the loss of whole blocks

Several authors have investigated conditions for a binary block design, D, to be maximally robust such that every eventual design obtained from D by eliminating r [ υ ] − 1 blocks is connected, where r [ υ ] is the smallest treatment replication. Four new results for the maximal robustness of D with superior properties are given. An extension of these results to widen the assessment of robustness of the planned design is also presented.