Franek, F.; Grannell, M.J.; Griggs, T.S. and Rosa, A.
(2002).
| DOI (Digital Object Identifier) Link: | http://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 Article |
|---|---|
| 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/Department: | 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: | 02 Aug 2016 12:52 |
| URI: | http://oro.open.ac.uk/id/eprint/2147 |
| Share this page: |     |
Altmetrics | Scopus Citations |