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

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


Support Sizes of Directed Triple Systems
โœ S. Milici; G. Quattrocchi; H. Shen ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 657 KB

In this paper, we determine the spectrum of support sizes of directed triple systems, for all \*.

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 _

The spectrum of support sizes for threef
โœ Charles J. Colbourn; Ebadollah S. Mahmoodian ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 656 KB

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

Resolvable Mendelsohn triple systems wit
โœ F. E. Bennett; R. Wei; L. Zhu ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 165 KB ๐Ÿ‘ 2 views

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 with
โœ K. Chen; G. Ge; L. Zhu ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 154 KB ๐Ÿ‘ 2 views

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