DOIAbstract
AbstractA complete arc in a design is a set of elements which contains no block and is maximal with respect to this property. The spectrum of sizes of complete arcs in Steiner triple systems is determined without exception here
AbstractA complete arc in a design is a set of elements which contains no block and is maximal with respect to this property. The spectrum of sizes of complete arcs in Steiner triple systems is determined without exception here
AbstractWe study the coloring properties of STSs and derive several inequalities for the sizes of th...
AbstractThe concept of good large set of Steiner triple systems (or GLS in short) was introduced by ...
AbstractWe give the first known examples of 6-sparse Steiner triple systems by constructing 29 such ...
AbstractA complete arc in a design is a set of elements which contains no block and is maximal with ...
A complete arc in a design is a set of elements which contains no block, and is maximal with respect...
AbstractA spanning set in a Steiner triple system is a set of elements for which each element not in...
AbstractWe establish that for all s, there exists a design with parameters (s2,3,2) such that the po...
AbstractA maximal arc in a Steiner system S(2,4,v) is a set of elements which intersects every block...
AbstractFor a Steiner triple system of order v to have a complete s-arc one must have s(s + 1)/2⩾v w...
AbstractSuppose S is a Steiner triple-system on the n-element set X, i.e., for every pair of distinc...
We consider the sets of all possible Steiner triple systems (STS) which can be defined on a 7-set or...
AbstractA Steiner triple system of order v (briefly STS(v)) consists of a v-element set X and a coll...
A Steiner triple system of order v (STS(v)) is called x-chromatic if x is the smallest number of col...
AbstractFor each admissible v, we exhibit a path design P(v, 4, 1) with a spanning set of minimum ca...
Given a partial Steiner triple system (STS) of order n, what is the order of the smallest complete S...
AbstractWe study the coloring properties of STSs and derive several inequalities for the sizes of th...
AbstractThe concept of good large set of Steiner triple systems (or GLS in short) was introduced by ...
AbstractWe give the first known examples of 6-sparse Steiner triple systems by constructing 29 such ...
AbstractA complete arc in a design is a set of elements which contains no block and is maximal with ...
A complete arc in a design is a set of elements which contains no block, and is maximal with respect...
AbstractA spanning set in a Steiner triple system is a set of elements for which each element not in...
AbstractWe establish that for all s, there exists a design with parameters (s2,3,2) such that the po...
AbstractA maximal arc in a Steiner system S(2,4,v) is a set of elements which intersects every block...
AbstractFor a Steiner triple system of order v to have a complete s-arc one must have s(s + 1)/2⩾v w...
AbstractSuppose S is a Steiner triple-system on the n-element set X, i.e., for every pair of distinc...
We consider the sets of all possible Steiner triple systems (STS) which can be defined on a 7-set or...
AbstractA Steiner triple system of order v (briefly STS(v)) consists of a v-element set X and a coll...
A Steiner triple system of order v (STS(v)) is called x-chromatic if x is the smallest number of col...
AbstractFor each admissible v, we exhibit a path design P(v, 4, 1) with a spanning set of minimum ca...
Given a partial Steiner triple system (STS) of order n, what is the order of the smallest complete S...
AbstractWe study the coloring properties of STSs and derive several inequalities for the sizes of th...
AbstractThe concept of good large set of Steiner triple systems (or GLS in short) was introduced by ...
AbstractWe give the first known examples of 6-sparse Steiner triple systems by constructing 29 such ...
Add to ORKG