✦ LIBER ✦

On the existence of automorphism free Steiner triple systems

✍ Scribed by Charles C Lindner; Alexander Rosa

Publisher: Elsevier Science
Year: 1975
Tongue: English
Weight: 672 KB
Volume: 34
Category: Article
ISSN: 0021-8693
DOI: 10.1016/0021-8693(75)90167-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The existence of reverse Steiner triple

The existence of reverse Steiner triple systems

✍ Luc Teirlinck 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 184 KB

A Steiner triple system of order u is called reverse if its automorphism group contains an involution fixing only one point. We show mat such a system exists if and only if u = 1,3, 9 or 19 (mod 24).

On the groups of automorphisms of Steine

On the groups of automorphisms of Steiner triple and quadruple systems

✍ Eric Mendelsohn 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 405 KB

Existence of non-resolvable Steiner trip

Existence of non-resolvable Steiner triple systems

✍ (Ben) Pak Ching Li; G. H. J. van Rees 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB 👁 1 views

## Abstract We consider two well‐known constructions for Steiner triple systems. The first construction is recursive and uses an STS(__v__) to produce a non‐resolvable STS(2__v__ + 1), for __v__ ≡ 1 (mod 6). The other construction is the Wilson construction that we specify to give a non‐resolvable

On the chromatic numbers of Steiner trip

On the chromatic numbers of Steiner triple systems

✍ Lucien Haddad 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 2 views

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.

A simplification of Moore's proof of the

A simplification of Moore's proof of the existence of Steiner triple systems

✍ A.J.W Hilton 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 149 KB

On the maximum number of disjoint Steine

On the maximum number of disjoint Steiner triple systems

✍ Luc Teirlinck 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Let D(u) be the maximum number of pairwk disjoint Steiner triple sysiems of order v. We prove that D(3v:r 2 2v + D(v) for every u = 1 oi 3 (mod 6), u 2 3. As a corollary, we have D(3n) -3n-2 for every n 2 1.