AbstractA (K4−e)-design of order v+w embeds a given Steiner triple system if there is a subset of v points on which the graphs of the design induce the blocks of the original Steiner triple system. It has been established that w≥v/3, and that when equality is met, such a minimum embedding of an STS(v) exists, except when v=15. Equality only holds when v≡15,27(mod30). One natural question is: What is the smallest order w such that some STS(v) can be embedded into a (K4−e)-design of order v+w? We solve the problem for 7 of the 10 congruence classes modulo 30
Let G = (V, E) be a simple graph and let T = (P, B) be a Steiner triple system. Let φ be a one-to-...
AbstractIt is known that any partial Steiner triple system of order υ can be embedded in a Steiner t...
A Steiner system S(2, 4, v) is a v-element set V together with a collection B of 4-subsets of V call...
A (K4−e)-design on v+w points embeds a Steiner triple system if there is a subset of v points on whi...
AbstractA (K4−e)-design of order v+w embeds a given Steiner triple system if there is a subset of v ...
AbstractA (K4-e)-design on v+w points embeds a Steiner triple system (STS) if there is a subset of v...
AbstractWe initiate a systematic study of embeddings of Steiner triple systems into Steiner systems ...
A partial Steiner triple system of order u is a pair (U, A), where U is a set of u elements and A is...
AbstractA triple system of order v+w and index λ embeds a P3-design on v points if there is a subset...
AbstractAny partial Steiner triple system of order u can be embedded in a Steiner triple system of o...
Any partial Steiner triple system of order u can be embedded in a Steiner triple system of order v i...
AbstractA Steiner system S(t,k,v) is a pair (X,B), where X is a v-element set and B is a set of k-su...
Given a partial Steiner triple system (STS) of order n, what is the order of the smallest complete S...
AbstractA partial triple system of order v, PT(v), is pair (V, B) where V is a v-set, and B is a col...
Using an orderly algorithm, the Steiner triple systems of order 19 are classified; there are 11,084,...
Let G = (V, E) be a simple graph and let T = (P, B) be a Steiner triple system. Let φ be a one-to-...
AbstractIt is known that any partial Steiner triple system of order υ can be embedded in a Steiner t...
A Steiner system S(2, 4, v) is a v-element set V together with a collection B of 4-subsets of V call...
A (K4−e)-design on v+w points embeds a Steiner triple system if there is a subset of v points on whi...
AbstractA (K4−e)-design of order v+w embeds a given Steiner triple system if there is a subset of v ...
AbstractA (K4-e)-design on v+w points embeds a Steiner triple system (STS) if there is a subset of v...
AbstractWe initiate a systematic study of embeddings of Steiner triple systems into Steiner systems ...
A partial Steiner triple system of order u is a pair (U, A), where U is a set of u elements and A is...
AbstractA triple system of order v+w and index λ embeds a P3-design on v points if there is a subset...
AbstractAny partial Steiner triple system of order u can be embedded in a Steiner triple system of o...
Any partial Steiner triple system of order u can be embedded in a Steiner triple system of order v i...
AbstractA Steiner system S(t,k,v) is a pair (X,B), where X is a v-element set and B is a set of k-su...
Given a partial Steiner triple system (STS) of order n, what is the order of the smallest complete S...
AbstractA partial triple system of order v, PT(v), is pair (V, B) where V is a v-set, and B is a col...
Using an orderly algorithm, the Steiner triple systems of order 19 are classified; there are 11,084,...
Let G = (V, E) be a simple graph and let T = (P, B) be a Steiner triple system. Let φ be a one-to-...
AbstractIt is known that any partial Steiner triple system of order υ can be embedded in a Steiner t...
A Steiner system S(2, 4, v) is a v-element set V together with a collection B of 4-subsets of V call...