On 6-sparse Steiner triple systems

We 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.     

On making two Steiner triple systems disjoint

We prove that if (S₁, β₁) and (S₂, β₂) are two Steiner triple systems of order v and if S is a set of v points, then there exist two disjoint Steiner triple systems (S, β₁′) and (S, β₂′) with (S₁, β₁) ? (S, β₁′) and (S₂, β₂) ? (S, β₂′).     

Cliques in Steiner systems

A partial Steiner (k,l)-system is a k-uniform hypergraph with the property that every l-element subset of V is contained in at most one edge of . In this paper we show that for given k,l and t there exists a partial Steiner (k,l)-system such that whenever an l-element subset from every edge is chosen, the resulting l-uniform hypergraph contains a clique of size t. As the main result of this note, we establish asymptotic lower and upper bounds on the size of such cliques with respect to the order of Steiner systems. Research of the second author partially supported by NSERC grant OGP0025112.     

Hyperovals in Steiner systems

In this paper, we show that the basic necessary condition for the existence of a (k; 0, 2)-set in an S(2, 4, v) is also sufficient. It solves a problem posed by de Resmini [6] and we also prove some asymptotic results concerning the existence of hyperovals in Steiner systems with large block size. The results are generally applicable to designs with maximal arcs.     

Some packings with Steiner triple systems

For eleven values of v, the following problem is solved To partition, into v?2 Steiner triple system, the set of all the combinations of v things three at a time.     

On the chromatic numbers of Steiner triple systems

Geometric properties are used to determine the chromatic number of AG(4, 3) and to derive some important facts on the chromatic number of PG(n, 2). It is also shown that a 4-chromatic STS(v) exists for every admissible order v ≥ 21. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 1–10, 1999     

On sets of pairwise disjoint blocks in Steiner triple systems

In a Steiner triple system with 19 points, each disjoint pair blocks is contained in at least 43 quadruplets of pairwise disjoint blocks. In a Steiner triple system with 25 points, each disjoint pair of blocks is contained in a pairwise disjoint quintuple of blocks. Theorems used are those of Connor on determinants based on intersecting and nonintersecting blocks of a BIBD, and of Turán on extremal graphs without triangles.     

On the maximum number of disjoint Steiner triple systems

Let D(v) be the maximum number of pairwise disjoint Steiner triple systems of order v. We prove that D(3v)≥2v+D(v) for every v ≡ 1 or 3 (mod 6), v≥3. As a corollary, we have D(3ⁿ)=3ⁿ-2 for every n≥1.     

Steiner triple systems with two disjoint subsystems

It is shown that there exists a triangle decomposition of the graph obtained from the complete graph of order v by removing the edges of two vertex disjoint complete subgraphs of orders u and w if and only if u,w, and v are odd, (mod 3), and . Such decompositions are equivalent to group divisible designs with block size 3, one group of size u, one group of size w, and v – u – w groups of size 1. This result settles the existence problem for Steiner triple systems having two disjoint specified subsystems, thereby generalizing the well‐known theorem of Doyen and Wilson on the existence of Steiner triple systems with a single specified subsystem. © 2005 Wiley Periodicals, Inc. J Combin Designs     

Steiner triple systems with block-transitive automorphism groups

This paper describes the Steiner triple systems which have automorphism groups acting transitively on the blocks but not doubly transitively on the points. In the case of those systems not previously described, there is a group acting regularly on the blocks and the number of points is a prime power congruent to 7 modulo 12. A formula yielding the number (up to isomorphism) of these systems with a given number of points is derived.     

On large sets of disjoint Steiner triple systems II

Let D(v) denote the maximum number of pairwise disjoint Steiner triple systems of order v. In this paper, we prove that if n is an odd number, there exist 12 mutually orthogonal Latin squares of order n and D(1 + 2n) = 2n ? 1, then D(1 + 12n) = 12n ? 1.     

On minimal non-orientable matroids with elements and rank

We describe an infinite family M_n,k, with n≥4 and 1≤k≤n−2, of minimal non-orientable matroids of rank n on a set with 2n elements. For k=1,n−2, M_n,k is isomorphic to the Bland–Las Vergnas matroid M_n. For every 2≤k≤n−3 a new minimal non-orientable matroid is obtained. All proper minors of the matroids M_n,k are representable over .     

Embedding Steiner triple systems in hexagon triple systems

A hexagon triple is the graph consisting of the three triangles (triples) {a,b,c},{c,d,e}, and {e,f,a}, where a,b,c,d,e, and f are distinct. The triple {a,c,e} is called an inside triple. A hexagon triple system of order n is a pair (X,H) where H is a collection of edge disjoint hexagon triples which partitions the edge set of K_n with vertex set X. The inside triples form a partial Steiner triple system. We show that any Steiner triple system of order n can be embedded in the inside triples of a hexagon triple system of order approximately 3n.     

Ubiquitous configurations in Steiner triple systems

A Steiner triple system S is a C-ubiquitous (where C is a configuration) if every line of S is contained in a copy of C, and is n-ubiquitous if it is C-ubiquitous for every n-line configuration C. We determine the spectrum of 4-ubiquitous Steiner triple systems as well as the spectra of C-ubiquitous Steiner triple systems for all configurations C with five lines. © 1997 John Wiley & Sons, Inc.