Abstract
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.
Publication Date
1996
Document Type
Article
Department, Program, or Center
Center for Advancing the Study of CyberInfrastructure
Recommended Citation
The Journal of Combinatorial Mathematics and Combinatorial Computing 22 (1996) 211-222
Campus
RIT – Main Campus
COinS
Comments
ISSN:0835-3026 Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2014.