In this paper, we determine the spectrum of support sizes of directed triple systems, for all \*.
Support sizes of triple systems
โ Scribed by Charles J Colbourn; Charles C Lindner
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 950 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## 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 _
The spectrum of possible numbers of distinct blocks in a threefold triple system of order u is determined. Let m, = [u(u -1)/6]. A threefold triple system with u = 1, 3 (mod 6) elements can have any number of distinct blocks from, and only from, {m,, m, + 4, m, +6, m, + 7;.., 3m,} provided u # 3, 7
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)
Generalized Steiner triple systems, GS(2, 3, n, g) are used to construct maximum constant weight codes over an alphabet of size g 1 with distance 3 and weight 3 in which each codeword has length n. The existence of GS(2, 3, n, g) has been solved for g 2, 3, 4, 9. In this paper, by introducing a spec