Enumeration of 2-(9, 3, ) designs and their resolutions

DOI10.1023/A:1016558720904zbMATH Open0996.05008MaRDI QIDQ697635FDOQ697635

Petteri Kaski, Patric R. J. Östergård

Publication date: 17 September 2002

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Recommendations

• scientific article
• scientific article; zbMATH DE number 1556751
• Miscellaneous classification results for 2-designs
• scientific article; zbMATH DE number 4029580
• There are \(270, 474, 142\) nonisomorphic \(2\)-\((9, 4, 6)\) designs
• On the classification of resolvable 2-\((12, 6, 5c)\) designs
• scientific article; zbMATH DE number 6787622
• On the (15,5,\(\lambda\) )-family of BIBDs
• Enumeration of resolvable 2‐(10, 5, 16) and 3‐(10, 5, 6) designs
• Doubly resolvable designs from generalized Bhaskar Rao designs

zbMATH Keywords

automorphism groupBIBDorderly algorithmresolved design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Triple systems (05B07)

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Miscellaneous classification results for 2-designs
• Title not available (Why is that?)
• There are \(270, 474, 142\) nonisomorphic \(2\)-\((9, 4, 6)\) designs
• Title not available (Why is that?)
• Enumeration of resolvable 2‐(10, 5, 16) and 3‐(10, 5, 6) designs

This page was built for publication: Enumeration of 2-(9, 3, \({\lambda}\)) designs and their resolutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697635)