𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Embeddings of Resolvable Triple Systems

✍ Scribed by Hao Shen; Yizhu Wang


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
165 KB
Volume
89
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

✦ Synopsis


Let RB(3, *; v) denote a resolvable *-fold triple system of order v. It is proved in this paper that the necessary and sufficient conditions for the embedding of an RB(3, *; v) in an RB(3, *; u) are u 3v and (i) u#v#3 (mod 6) if *#1 (mod 2), (ii) u#v#3 (mod 3) if *#0 (mod 4), or (iii) u#v#0 (mod 3) and v{6 if *#2 (mod 4). Necessary and sufficient conditions for the embeddings of resolvable directed triple systems are also determined for all *.


πŸ“œ SIMILAR VOLUMES


Surface embeddings of Steiner triple sys
✍ M. J. Grannell; T. S. Griggs; Jozef S˘irΓ‘n˘ πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 421 KB πŸ‘ 1 views

A Steiner triple system of order n (STS(n)) is said to be embeddable in an orientable surface if there is an orientable embedding of the complete graph Kn whose faces can be properly 2-colored (say, black and white) in such a way that all black faces are triangles and these are precisely the blocks

Existence of non-resolvable Steiner trip
✍ (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

Support sizes of threefold resolvable tr
✍ Yanxun Chang; Giovanni Lo Faro; Hao Shen πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 144 KB πŸ‘ 1 views

## Abstract Let __SS__~__R__~(__v__, 3) denote the set of all integer __b__\* such that there exists a __RTS__(__v__, 3) with __b__\* distinct triples. In this paper, we determine the set __SS__~__R__~(__v__, 3) for __v__ ≑ 3 (mod 6) and __v__ β‰₯ 3 with only five undecided cases. We establish that _

On large sets of resolvable and almost r
✍ 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

Embeddings of pure mendelsohn triple sys
✍ Shen Hao πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 493 KB

## Abstract It is proved in this article that the necessary and sufficient conditions for the embedding of a λ‐fold pure Mendelsohn triple system of order __v__ in λ‐__fold__ pure Mendelsohn triple of order __u__ are Ξ»__u__(__u__ βˆ’ 1) ≑ 0 (mod 3) and __u__ β©Ύ 2__v__ + 1. Similar results for the embe

Almost resolvable cycle systemsβ€”an analo
✍ C. C. Lindner; M. Meszka; A. Rosa πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 123 KB

## Abstract The purpose of this paper is the initiation of an attack on the __general existence problem__ for almost resolvable 2__k__‐cycle systems. We give a complete solution for 2__k__=6 as well as a complete solution modulo one possible exception for 2__k__=10 and 14. We also show that the exi