๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On making two Steiner triple systems disjoint

โœ Scribed by Luc Teirlinck

Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
118 KB
Volume
23
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Steiner triple systems with two disjoint
Steiner triple systems with two disjoint subsystems
โœ Darryn Bryant; Daniel Horsley ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 123 KB

## Abstract 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, ${{v}\choose 2}-{u\choose 2}- {w\choos

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.