Resolvable pairwise balanced designs.
From MaRDI portal
Publication:1299062
DOI10.1016/S0378-3758(98)00045-7zbMath1055.62535WikidataQ127754148 ScholiaQ127754148MaRDI QIDQ1299062
Mohan S. Shrikhande, Ionin, Yury J.
Publication date: 1998
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Related Items (3)
On the structure of 1-designs with at most two block intersection numbers ⋮ Every SOMA\((n - 2, n)\) is Trojan ⋮ Incidence matrices and inequalities for combinatorial designs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On resolutions and Bose's theorem
- A survey of pseudo \((v,k,\lambda)\)-designs
- Equidistant families of sets
- On the \(\lambda\)-design conjecture
- An extension of a theorem of the Bruijn and Erdős on combinatorial designs
- A property of (\(v\),\(k\),\(\lambda\))-designs
- On the Composition of Balanced Incomplete Block Designs
- Square λ-Linked Designs
This page was built for publication: Resolvable pairwise balanced designs.