On Large Sets of v−1 L-Intersecting Steiner Triple Systems of Order v

Authors:
F. Franek;M. J. Grannell;T. S. Griggs;A. Rosa
Affiliations:
Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1, Canada;Department of Pure Mathematics, The Open University, Walton Hall, Milton Keynes, MK7 6AA, United Kingdom m.j.grannell@open.ac.uk;Department of Pure Mathematics, The Open University, Walton Hall, Milton Keynes, MK7 6AA, United Kingdom;Department of Mathematics and Statistics, McMaster University, Hamilton, Ontario, L8S 4K1, Canada
Venue:
Designs, Codes and Cryptography
Year:
2002

Citing 2
Cited 1

A completion of Lu's determination of the spectrum of large sets of disjoint Steiner Triple systems

Journal of Combinatorial Theory Series A
Large sets of Steiner triple systems

Surveys in combinatorics, 1995

Constructions for large sets of L-intersecting Steiner triple systems

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

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 n≥2 a large set of 3n−1 STS (3n) whose systems intersect in 0 or 3 blocks.