𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the number of non isomorphic Steiner triple systems

✍ Scribed by Jean Doyen; Guy Valette

Publisher
Springer-Verlag
Year
1971
Tongue
French
Weight
806 KB
Volume
120
Category
Article
ISSN
0025-5874

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.

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.

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