On the Intersection Problem for Steiner Triple Systems of Different Orders

A Steiner triple system of order v, or STS(v), is a pair (V, ) with V a set of v points and a set of 3-subsets of V called blocks or triples, such that every pair of distinct elements of V occurs in exactly one triple. The intersection problem for STS is to determine the possible numbers of blocks common to two Steiner triple systems STS(u), (U, ), and STS(v), (V, ), with U⊆V. The case where U=V was solved by Lindner and Rosa in 1975. Here, we let U⊂V and completely solve this question for v−u=2,4 and for v≥2u−3. supported by NSERC research grant #OGP0170220. supported by NSERC postdoctoral fellowship. supported by NSERC research grant #OGP007621.     

A conjecture on small embeddings of partial Steiner triple systems

A well‐known, and unresolved, conjecture states that every partial Steiner triple system of order u can be embedded in a Steiner triple system of order υ for all υ ≡ 1 or 3, (mod 6), υ ≥ 2u + 1. However, some partial Steiner triple systems of order u can be embedded in Steiner triple systems of order υ <2u + 1. A more general conjecture that considers these small embeddings is presented and verified for some cases. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 313–321, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10017     

Generalized steiner triple systems with group size five

Generalized Steiner triple systems, GS(2, 3, n, g) are used to construct maximum constant weight codes over an alphabet of size g+1 with distance 3 and weight 3 in which each codeword has length n. The existence of GS(2, 3, n, g) has been solved for g=2, 3, 4, 9. In this paper, by introducing a special kind of holey generalized Steiner triple systems (denoted by HGS(2, 3, (n, u), g)), singular indirect product (SIP) construction for GDDs is used to construct generalized Steiner systems. The numerical necessary conditions for the existence of a GS(2, 3, n, g) are shown to be sufficient for g=5.     

Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs

A Steiner tree for a set S of vertices in a connected graph G is a connected subgraph of G with a smallest number of edges that contains S. The Steiner interval I(S) of S is the union of all the vertices of G that belong to some Steiner tree for S. If S={u,v}, then I(S)=I[u,v] is called the interval between u and v and consists of all vertices that lie on some shortest u-v path in G. The smallest cardinality of a set S of vertices such that ?_u,v∈SI[u,v]=V(G) is called the geodetic number and is denoted by g(G). The smallest cardinality of a set S of vertices of G such that I(S)=V(G) is called the Steiner geodetic number of G and is denoted by sg(G). We show that for distance-hereditary graphs g(G)?sg(G) but that g(G)/sg(G) can be arbitrarily large if G is not distance hereditary. An efficient algorithm for finding the Steiner interval for a set of vertices in a distance-hereditary graph is described and it is shown how contour vertices can be used in developing an efficient algorithm for finding the Steiner geodetic number of a distance-hereditary graph.     

Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems

A cubic graph G is S-edge-colorable for a Steiner triple system S if its edges can be colored with points of S in such a way that the points assigned to three edges sharing a vertex form a triple in S. We show that a cubic graph is S-edge-colorable for every non-trivial affine Steiner triple system S unless it contains a well-defined obstacle called a bipartite end. In addition, we show that all cubic graphs are S-edge-colorable for every non-projective non-affine point-transitive Steiner triple system S.     

Representing Graphs in Steiner Triple Systems

Let G =  (V, E) be a simple graph and let T =  (P, B) be a Steiner triple system. Let φ be a one-to-one function from V to P. Any edge e =  {u, v} has its image {φ(u), φ(v)} in a unique block in B. We also denote this induced function from edges to blocks by φ. We say that T represents G if there exists a one-to-one function φ : V → P such that the induced function φ : E → B is also one-to-one; that is, if we can represent vertices of the graph by points of the triple system such that no two edges are represented by the same block. In this paper we examine when a graph can be represented by an STS. First, we find a bound which ensures that every graph of order n is represented in some STS of order f(n). Second, we find a bound which ensures that every graph of order n is represented in every STS of order g(n). Both of these answers are related to finding an independent set in an STS. Our question is a generalization of finding such independent sets. We next examine which graphs can be represented in STS’s of small orders. Finally, we give bounds on the orders of STS’s that are guaranteed to embed all graphs of a given maximum degree.     

On the rank of 3×3×3-tensors

Let U, V and W be finite dimensional vector spaces over the same field. The rank of a tensor τ in U???V???W is the minimum dimension of a subspace of U???V???W containing τ and spanned by fundamental tensors, i.e. tensors of the form u???v???w for some u in U, v in V and w in W. We prove that if U, V and W have dimension three, then the rank of a tensor in U???V???W is at most six, and such a bound cannot be improved, in general. Moreover, we discuss how the techniques employed in the proof might be extended to prove upper bounds for the rank of a tensor in U???V???W when the dimensions of U, V and W are higher.     

The combinatorial game Nofil played on Steiner triple systems

We introduce an impartial combinatorial game on Steiner triple systems called Next One to Fill Is the Loser (Nofil ). Players move alternately, choosing points of the triple system. If a player is forced to fill a block on their turn, they lose. By computing nim-values, we determine optimal strategies for Nofil on all Steiner triple systems up to order 15 and a sampling for orders 19, 21 and 25. The game Nofil can be thought of in terms of play on a corresponding hypergraph which will become a graph during play. At that point Nofil is equivalent to playing the game Node Kayles on the graph. We prove necessary conditions and sufficient conditions for a graph to reached playing Nofil. We conclude that the complexity of determining the outcome of the game Nofil on Steiner triple systems is PSPACE-complete for randomized reductions.     

Skew-orthogonal steiner triple systems

Two Steiner triple systems, S₁=(V,ℬ︁₁) and S₂=(V,ℬ︁₂), are orthogonal (S₁ ⟂ S₂) if ℬ︁₁ ∩ ℬ︁₂=∅︁ and if {u,ν} ≠ {x,y}, uνw,xyw ∈ ℬ︁₁, uνs, xyt ∈ ℬ︁₂ then s ≠ t. The solution to the existence problem for orthogonal Steiner triple systems, (OSTS) was a major accomplishment in design theory. Two orthogonal triple systems are skew-orthogonal (SOSTS, written S₁∼S₂) if, in addition, we require uνw, xys ∈ ℬ︁₁ and uνt, xyw∈ ℬ︁₂ implies s ≠ t. Orthogonal triple systems are associated with a class of Room squares, with the skew orthogonal triple systems corresponding to skew Room squares. Also, SOSTS are related to separable weakly union-free TTS. SOSTS are much rarer than OSTS; for example SOSTS(ν) do not exist for ν=3,9,15. Furthermore, a fundamental construction for the earlier OSTS proofs when ν ≡ 3 (mod 6) cannot exist. In the case ν≡ 1 ( mod 6) we are able to show existence except possibly for 22 values, the largest of which is 1315. There are at least two non-isomorphic OSTS(19)s one of which is SOSTS(19) and the other not. A SOSTS(27) was found, implying the existence of SOSTS(ν) for ν ≡ 3 (mod 6) with finitely many possible exceptions.     

Sets of Harmonicity for Finely Harmonic Functions

Given an open set U in R ⁿ (n3) and a dense open subset V of U, it is shown that there is a finely harmonic function u on U such that V is the largest open subset of U on which u is harmonic. This result, which establishes the sharpness of a theorem of Fuglede, is obtained following a consideration of fine cluster sets of arbitrary functions.     

A proof of Lindner's conjecture on embeddings of partial Steiner triple systems

Lindner's conjecture that any partial Steiner triple system of order u can be embedded in a Steiner triple system of order v if and is proved. © 2008 Wiley Periodicals, Inc. J Combin Designs 17: 63–89, 2009     

Doubling and Tripling Constructions for Defining Sets in Steiner Triple Systems

 A minimal defining set of a Steiner triple system on v points (STS(v)) is a partial Steiner triple system contained in only this STS(v), and such that any of its proper subsets is contained in at least two distinct STS(v)s. We consider the standard doubling and tripling constructions for STS(2v+1) and STS(3v) from STS(v) and show how minimal defining sets of an STS(v) gives rise to minimal defining sets in the larger systems. We use this to construct some new families of defining sets. For example, for Steiner triple systems on 3 ⁿ points, we construct minimal defining sets of volumes varying by as much as 7 ⁿ⁻² . Received: September 16, 2000 Final version received: September 13, 2001 RID="*" ID="*" Research supported by the Australian Research Council A49937047, A49802044     

Quasi‐embeddings of Steiner triple systems,or Steiner triple systems of different orders with maximum intersection

In this paper, we present a conjecture that is a common generalization of the Doyen–Wilson Theorem and Lindner and Rosa's intersection theorem for Steiner triple systems. Given u, v ≡ 1,3 (mod 6), u < v < 2u + 1, we ask for the minimum r such that there exists a Steiner triple system such that some partial system can be completed to an STS , where |?| = r. In other words, in order to “quasi‐embed” an STS(u) into an STS(v), we must remove r blocks from the small system, and this r is the least such with this property. One can also view the quantity (u(u ? 1)/6) ? r as the maximum intersection of an STS(u) and an STS(v) with u < v. We conjecture that the necessary minimum r = (v ? u) (2u + 1 ? v)/6 can be achieved, except when u = 6t + 1 and v = 6t + 3, in which case it is r = 3t for t ≠ 2, or r = 7 when t = 2. Using small examples and recursion, we solve the cases v ? u = 2 and 4, asymptotically solve the cases v ? u = 6, 8, and 10, and further show for given v ? u > 2 that an asymptotic solution exists if solutions exist for a run of consecutive values of u (whose required length is no more than v ? u). Some results are obtained for v close to 2u + 1 as well. The cases where ≈ 3u/2 seem to be the hardest. © 2004 Wiley Periodicals, Inc.     

On the falsity of a conjecture on orthogonal steiner triple systems

A pair of orthogonal Steiner triple systems of order ν = 27 is constructed, thus showing the conjecture about the non-existence of a pair of orthogonal Steiner triple systems of orders ν ≡ 3 (mod 6) to be false.     

The spectrum of nested Steiner triple systems

A Steiner triple system can benested if it is possible to add one point to each block in such a way that a BIBD with block-size 4 and λ=1 is obtained. We prove that there exists a Steiner triple system of orderv that can be nested if and only ifvэ1 mod 6.     

Highly edge‐connected detachments of graphs and digraphs

Let G = (V,E) be a graph or digraph and r : V → Z₊. An r‐detachment of G is a graph H obtained by ‘splitting’ each vertex ν ∈ V into r(ν) vertices. The vertices ν₁,…,ν_r(ν) obtained by splitting ν are called the pieces of ν in H. Every edge uν ∈ E corresponds to an edge of H connecting some piece of u to some piece of ν. Crispin Nash‐Williams 9 gave necessary and sufficient conditions for a graph to have a k‐edge‐connected r‐detachment. He also solved the version where the degrees of all the pieces are specified. In this paper, we solve the same problems for directed graphs. We also give a simple and self‐contained new proof for the undirected result. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 67–77, 2003     

Uniform two‐class regular partial Steiner triple systems

A 2‐class regular partial Steiner triple system is a partial Steiner triple system whose points can be partitioned into 2‐classes such that no triple is contained in either class and any two points belonging to the same class are contained in the same number of triples. It is uniform if the two classes have the same size. We provide necessary and sufficient conditions for the existence of uniform 2‐class regular partial Steiner triple systems.