AbstractWe show that for every admissible order v≡0 or 2(mod6) there exists a near-Steiner triple system of order v that can be halved. As a corollary we obtain that a Steiner almost self-complementary graph with n vertices exists if and only if n≡0 or 2(mod6)
It has been conjectured that every Steiner triple system of order v 6= 7 has chromatic index at most...
Denote the set of 21 non-isomorphic cubic graphs of order 10 by L. We first determine precisely whic...
We give a construction that produces 6-sparse Steiner triple systems of order v for all sufficiently...
AbstractWe show that for every admissible order v≡0 or 2(mod6) there exists a near-Steiner triple sy...
AbstractWe examine the following question: for which orders does there exist a Steiner triple system...
Let n, k, and t be integers satisfying n> k> t ≥ 2. A Steiner system with parameters t, k, and...
We give the first known examples of 6-sparse Steiner triple systems by constructing 29 such systems ...
AbstractSuppose S is a Steiner triple-system on the n-element set X, i.e., for every pair of distinc...
For each positive integer n, we construct a Steiner triple system of order v = 2(3n) + 1 with no alm...
Given a partial Steiner triple system (STS) of order n, what is the order of the smallest complete S...
AbstractWe give the first known examples of 6-sparse Steiner triple systems by constructing 29 such ...
A partial Steiner triple system of order u is a pair (U, A), where U is a set of u elements and A is...
AbstractDenote the set of 21 non-isomorphic cubic graphs of order 10 by L. We first determine precis...
AbstractA Steiner 2-design S(2,k,v) is said to be halvable if the block set can be partitioned into ...
AbstractWe exhibit a large class of completable partial edge-colourings with a “large” number of col...
It has been conjectured that every Steiner triple system of order v 6= 7 has chromatic index at most...
Denote the set of 21 non-isomorphic cubic graphs of order 10 by L. We first determine precisely whic...
We give a construction that produces 6-sparse Steiner triple systems of order v for all sufficiently...
AbstractWe show that for every admissible order v≡0 or 2(mod6) there exists a near-Steiner triple sy...
AbstractWe examine the following question: for which orders does there exist a Steiner triple system...
Let n, k, and t be integers satisfying n> k> t ≥ 2. A Steiner system with parameters t, k, and...
We give the first known examples of 6-sparse Steiner triple systems by constructing 29 such systems ...
AbstractSuppose S is a Steiner triple-system on the n-element set X, i.e., for every pair of distinc...
For each positive integer n, we construct a Steiner triple system of order v = 2(3n) + 1 with no alm...
Given a partial Steiner triple system (STS) of order n, what is the order of the smallest complete S...
AbstractWe give the first known examples of 6-sparse Steiner triple systems by constructing 29 such ...
A partial Steiner triple system of order u is a pair (U, A), where U is a set of u elements and A is...
AbstractDenote the set of 21 non-isomorphic cubic graphs of order 10 by L. We first determine precis...
AbstractA Steiner 2-design S(2,k,v) is said to be halvable if the block set can be partitioned into ...
AbstractWe exhibit a large class of completable partial edge-colourings with a “large” number of col...
It has been conjectured that every Steiner triple system of order v 6= 7 has chromatic index at most...
Denote the set of 21 non-isomorphic cubic graphs of order 10 by L. We first determine precisely whic...
We give a construction that produces 6-sparse Steiner triple systems of order v for all sufficiently...
DOI
Add to ORKG