On large sets of v-1 L-intersecting Steiner triple systems of order v

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.

DOI: https://doi.org/10.1023/A:1016573729565

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.

Viewing alternatives

Metrics

Item Actions

Export

You can export this page using these formats Digital Object Identifier - DOI