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

On large sets of disjoint Steiner triple systems II

โœ Scribed by Lu Jia-Xi

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
482 KB
Volume
34
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Construction of large sets of pairwise d
Construction of large sets of pairwise disjoint transitive triple systems II
โœ C.C Lindner ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 563 KB

The maximum number of pairwise disjoint transitive triple systems (T'I'Ss) of order n is 3(n -2). Such a collection is called a large set of pairwise disjoint TI'Ss of order n. The main result in this paper is the proof of the following theorem: If n -1 or 5 (rood 6), and there exists a large set of

Further results about large sets of disj
Further results about large sets of disjoint Mendelsohn triple systems
โœ Qingde Kang; Yanxun Chang ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 374 KB

In this note, a construction of the large sets of pairwise disjoint Mendelsohn triple systems of order 72k + 6, where k > 1 and k F 1 or 2 (mod 3), is given. Let X be a set of v elements (v 2 3). A cyclic triple from X is a collection of three pairs (x, y), (y,z) and (z, x), where x,y and z are dis

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.