𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the existence of cycle frames and almost resolvable cycle systems

✍ Scribed by H. Cao; M. Niu; C. Tang

Book ID
113567377
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
274 KB
Volume
311
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Almost resolvable cycle systemsβ€”an analo
Almost resolvable cycle systemsβ€”an analogue of Hanani triple systems
✍ 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

1-rotationally resolvable 4-cycle system
1-rotationally resolvable 4-cycle systems of 2Kv
✍ Hung-Lin Fu; Miwako Mishima πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 126 KB

## Abstract In this article, it is shown that there exists a 1‐rotationally resolvable 4‐cycle system of 2K~Ο…~ if and only if υ ≑ 0 (mod 4). To prove that, some special sequences of integers are utilized. Β© 2002 Wiley Periodicals, Inc. J Combin Designs 10: 116–125, 2002; DOI 10.1002/jcd.10006

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