Bound on the maximum number of clear two-factor interactions for \(2^{n- (n-k)}\) designs
scientific article; zbMATH DE number 5631693