We report on progress on towards deciding the existence of 2-(22,8,4) designs without assuming any automorphisms. Using computer algorithms we have shown that in any such design every two blocks have nonempty intersection, every quadruple of points can occur in at most two blocks, and no three blocks can pairwise intersect in one point.
Department, Program, or Center
Center for Advancing the Study of CyberInfrastructure
The Journal of Combinatorial Mathematics and Combinatorial Computing 22 (1996) 211-222
RIT – Main Campus