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 (Digital Object Identifier) Link:	https://doi.org/10.1023/A:1016573729565
Google Scholar:	Look up in Google Scholar

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.

Item Type:	Journal Item
ISSN:	0925-1022
Extra Information:	Some of the symbols may not have transferred correctly into this bibliographic record.
Keywords:	Steiner triple systems; large sets
Academic Unit/School:	Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics Faculty of Science, Technology, Engineering and Mathematics (STEM)
Item ID:	2147
Depositing User:	Mike Grannell
Date Deposited:	06 Jun 2006
Last Modified:	04 Oct 2016 09:46
URI:	http://oro.open.ac.uk/id/eprint/2147
Share this page:

Altmetrics

Actions (login may be required)

CORE (COnnecting REpositories)

Policies | Disclaimer