2007
DOI: 10.1016/j.jcta.2006.04.003
|View full text |Cite
|
Sign up to set email alerts
|

On 6-sparse Steiner triple systems

Abstract: We give the first known examples of 6-sparse Steiner triple systems by constructing 29 such systems in the residue class 7 modulo 12, with orders ranging from 139 to 4447. We then present a recursive construction which establishes the existence of 6-sparse systems for an infinite set of orders. Observations are also made concerning existing construction methods for perfect Steiner triple systems, and we give a further example of such a system. This has order 135,859 and is only the fourteenth known. Finally, w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
35
0

Year Published

2007
2007
2020
2020

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 28 publications
(35 citation statements)
references
References 14 publications
0
35
0
Order By: Relevance
“…The special mitres and Pasch configurations that are shown in [4] to be unavoidable in all systems with sufficiently large order obtained from Theorem 2 do not form in the twogenerator systems of Theorem 4. We now prove that there is no such blocking mechanism to prevent the formation of 6-sparse two-generator systems of arbitrarily large orders.…”
Section: Steiner Triple Systems With V ≡ 9 (Mod 12)mentioning
confidence: 91%
See 3 more Smart Citations
“…The special mitres and Pasch configurations that are shown in [4] to be unavoidable in all systems with sufficiently large order obtained from Theorem 2 do not form in the twogenerator systems of Theorem 4. We now prove that there is no such blocking mechanism to prevent the formation of 6-sparse two-generator systems of arbitrarily large orders.…”
Section: Steiner Triple Systems With V ≡ 9 (Mod 12)mentioning
confidence: 91%
“…In [4] we presented the first known non-trivial examples of 6-sparse Steiner triple systems. Our results depended on two basic theorems.…”
Section: Crown Configurationmentioning
confidence: 99%
See 2 more Smart Citations
“…The direct product construction for 5-sparse STSs, developed by Ling [27], employs an abelian group which acts regularly on the point set. Forbes, Grannell and Griggs [13] discovered a construction method for blocktransitive STSs and found examples of 6-sparse STSs, which have the highest sparseness at the time of writing. They also developed a recursive construction similar to Theorem 1.5 for 6-sparse STSs and constructed infinitely many examples of such STSs.…”
Section: ) Let L(k L) Be the Family Of All Nonisomorphic 3-uniform Hmentioning
confidence: 99%