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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. J. Colbourn and A. Rosa, Triple Systems, Oxford University Press (1999).
T. S. Griggs and A. Rosa, Large sets of Steiner triple systems, In (P. Rowlinson, ed.), Surveys in Combinatorics, London Math. Soc. Lecture Note Series, Vol. 218, Cambridge University Press (1995) pp. 25–39.
T. S. Griggs and A. Rosa, Sets of Steiner triple systems of order 9 revisited, to appear.
C. C. Lindner and A. Rosa, Construction of large sets of almost disjoint Steiner triple systems, Canad. J. Math., Vol. 27 (1975) pp. 256–260.
J. X. Lu, On large sets of disjoint Steiner triple systems I–III, J. Combinat. Theory (Ser. A), Vol. 34 (1983) pp. 140–182.
J. X. Lu, On large sets of disjoint Steiner triple systems IV–VI, J. Combinat. Theory (Ser. A), Vol. 37 (1984) pp. 136–192.
J. X. Lu, On large sets of disjoint Steiner triple systems VII, unpublished manuscript (1984).
R. A. Mathon, K. T. Phelps and A. Rosa, Small Steiner triple systems and their properties, Ars Combin., Vol. 15 (1983) pp. 3–110.
L. Teirlinck, A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems, J. Combinat. Theory (Ser. A), Vol. 57 (1991) pp. 302–305.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Franek, F., Grannell, M.J., Griggs, T.S. et al. On Large Sets of v−1 L-Intersecting Steiner Triple Systems of Order v . Designs, Codes and Cryptography 26, 243–256 (2002). https://doi.org/10.1023/A:1016573729565
Issue Date:
DOI: https://doi.org/10.1023/A:1016573729565