On resolutions and Bose's theorem
From MaRDI portal
Publication:1235172
DOI10.1007/BF00148147zbMath0351.05013MaRDI QIDQ1235172
Publication date: 1976
Published in: Geometriae Dedicata (Search for Journal in Brave)
Combinatorial aspects of partitions of integers (05A17) Combinatorial aspects of block designs (05B05)
Related Items (12)
A survey of some problems in combinatorial designs - a matrix approach ⋮ Embeddings in strongly resolvable designs ⋮ 2-designs having an intersection number \(k-n\) ⋮ New bound for affine resolvable designs and its application to authentication codes ⋮ On extremal intersection numbers of a block design ⋮ Necessary conditions for the existence of divisible designs ⋮ Algebraic duality theorems with combinatorial applications ⋮ The family of block designs with some combinatorial properties ⋮ On the parameters of strongly resolvable designs ⋮ Resolvable pairwise balanced designs. ⋮ Strongly resolvable (r,lambda)-designs ⋮ Tactical decompositions of designs
This page was built for publication: On resolutions and Bose's theorem