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 (m
Support sizes of threefold resolvable triple systems
β Scribed by Yanxun Chang; Giovanni Lo Faro; Hao Shen
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 144 KB
- Volume
- 11
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
β¦ Synopsis
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 SS~R~(v, 3) = P(v, 3) for v β‘ 3 (mod 6), v β₯ 21 and v β 33, 39 where P(v, 3) = {m~v~, m~v~ + 4, m~v~ + 6, m~v~ + 7, β¦, 3__m__~v~} and m~v~, = v(v β 1)/6. As a byβproduct, we remove the last two undecided cases for the intersection numbers of Kirkman triple system of order 27, this improves the known result provided in [2]. Β© 2003 Wiley Periodicals, Inc. J Combin Designs 11: 275β289, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/jcd.10037
π SIMILAR VOLUMES
An HMTS of type {n1 , n2 , . . . , n h } is a directed graph DKn 1 ,n 2 ,...,n h , which can be decomposed into 3-circuits. If the 3-circuits can be partitioned into parallel classes, then the HMTS is called an RHMTS. In this article it is shown that the RHMTSs of type m h exist when mh β‘ 0 (mod 3)
## 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
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
## 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
This paper reports on an experimental study of information sharing for groups using a group support system (GSS). A group member's success or failure in sharing unique information can have important impacts on meeting outcomes. This research builds on previous work which has examined various factors