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

Tripling Construction for Large Sets of Resolvable Directed Triple Systems

โœ Scribed by Jun Ling Zhou; Yan Xun Chang

Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2005
Tongue
English
Weight
173 KB
Volume
22
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On large sets of resolvable and almost r
On large sets of resolvable and almost resolvable oriented triple systems
โœ Qingde Kang; Jianguo Lei ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 430 KB ๐Ÿ‘ 1 views

An MTS(v) [or DTS(v)] is said to be resolvable, denoted by RMTS(v) [or RDTS(v)], if its block set can be partitioned into parallel classes. An MTS(v) [or DTS(v)] is said to be almost resolvable, denoted by ARMTS(v) [or ARDTS(v)], if its bloak set can be partitioned into almost parallel classes. The

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

On large sets of hybrid triple systems
On large sets of hybrid triple systems
โœ Qing-de Kang; Jian-guo Lei ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 352 KB