Franek, F.; Grannell, M.J.; Griggs, T.S. and Rosa, A.
(2002).
On large sets of v-1 L-intersecting Steiner triple systems of order v.
Designs, Codes and Cryptography, 26(1-3) pp. 243–256.
Abstract
This paper presents four new recursive constructions for large sets of v–1 STS(v). These facilitate the production of several new infinite families of such large sets. In particular, we obtain for each n2 a large set of 3 n –1 STS (3 n ) whose systems intersect in 0 or 3 blocks.
Altmetrics | Scopus Citations |
| |
Actions (login may be required)
