AbstractWe 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, we present a uniform Steiner triple system of order 180,907
The existence of Steiner triple systems STS(n) of order n containing no nontrivial subsystem is well...
AbstractA Steiner triple system of order v is called reverse if its automorphism group contains an i...
AbstractSuppose S is a Steiner triple-system on the n-element set X, i.e., for every pair of distinc...
AbstractWe give the first known examples of 6-sparse Steiner triple systems by constructing 29 such ...
We give the first known examples of 6-sparse Steiner triple systems by constructing 29 such systems ...
AbstractThis paper shows the existence of 5-sparse Steiner triple systems of order n≡3mod6 for n⩾21 ...
A (Formula presented.) -configuration is a set of (Formula presented.) blocks on (Formula presented....
A (Formula presented.) -configuration is a set of (Formula presented.) blocks on (Formula presented....
We give a construction that produces 6-sparse Steiner triple systems of order v for all sufficiently...
A Steiner triple system of order v (STS(v)) is called x-chromatic if x is the smallest number of col...
AbstractThis paper shows the existence of 5-sparse Steiner triple systems of order n≡3mod6 for n⩾21 ...
Steiner triple systems are known to exist for orders n ≡ 1, 3 mod 6. There are many known constructi...
Since 1847 when Rev. T.P. Kirkman published his first paper [24], research in Steiner triple systems...
For each positive integer n, we construct a Steiner triple system of order v=2(3n)+1 with no almost ...
Properties of the 11 084 874 829 Steiner triple systems of order 19 are examined. In particular, the...
The existence of Steiner triple systems STS(n) of order n containing no nontrivial subsystem is well...
AbstractA Steiner triple system of order v is called reverse if its automorphism group contains an i...
AbstractSuppose S is a Steiner triple-system on the n-element set X, i.e., for every pair of distinc...
AbstractWe give the first known examples of 6-sparse Steiner triple systems by constructing 29 such ...
We give the first known examples of 6-sparse Steiner triple systems by constructing 29 such systems ...
AbstractThis paper shows the existence of 5-sparse Steiner triple systems of order n≡3mod6 for n⩾21 ...
A (Formula presented.) -configuration is a set of (Formula presented.) blocks on (Formula presented....
A (Formula presented.) -configuration is a set of (Formula presented.) blocks on (Formula presented....
We give a construction that produces 6-sparse Steiner triple systems of order v for all sufficiently...
A Steiner triple system of order v (STS(v)) is called x-chromatic if x is the smallest number of col...
AbstractThis paper shows the existence of 5-sparse Steiner triple systems of order n≡3mod6 for n⩾21 ...
Steiner triple systems are known to exist for orders n ≡ 1, 3 mod 6. There are many known constructi...
Since 1847 when Rev. T.P. Kirkman published his first paper [24], research in Steiner triple systems...
For each positive integer n, we construct a Steiner triple system of order v=2(3n)+1 with no almost ...
Properties of the 11 084 874 829 Steiner triple systems of order 19 are examined. In particular, the...
The existence of Steiner triple systems STS(n) of order n containing no nontrivial subsystem is well...
AbstractA Steiner triple system of order v is called reverse if its automorphism group contains an i...
AbstractSuppose S is a Steiner triple-system on the n-element set X, i.e., for every pair of distinc...