Enumeration of resolvable 2‐(10, 5, 16) and 3‐(10, 5, 6) designs

DOI10.1002/jcd.20032zbMath1059.05017OpenAlexW2124329301MaRDI QIDQ4667828

Luis B. Morales, Carlos Velarde

Publication date: 21 April 2005

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20032

zbMATH Keywords

parallel classresolvable \(t\)-designbacktrack search with isomorph rejection

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of block designs (05B05)

Related Items (3)

Isomorphism and Invariants of Parallelisms of Projective Spaces ⋮ The maximum number of columns in E(s2) $\,E({s}^{2})$‐optimal supersaturated designs with 16 rows and smax=4 ${s}_{{\rm{\max }}}=4$ is 60 ⋮ On the Enumeration of ‐Optimal and Minimax‐Optimal k‐Circulant Supersaturated Designs

Uses Software

• nauty

This page was built for publication: Enumeration of resolvable 2‐(10, 5, 16) and 3‐(10, 5, 6) designs