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

Partitions of triples into optimal packings

โœ Scribed by Tuvi Etzion

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
832 KB
Volume
59
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimal partitions for triples
Optimal partitions for triples
โœ Tuvi Etzion ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 822 KB
Optimal packings of K4's into a Kn
Optimal packings of K4's into a Kn
โœ A.E. Brouwer ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 957 KB
Partitioning twofold triple systems into
Partitioning twofold triple systems into complete arcs
โœ K.T. Phelps; M.J. de Resmini ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 512 KB

We establish that for all s, there exists a design with parameters (s', 3, 2) such that the points can be partitioned into s complete s-arcs. Furthermore we present a general technique which applies to the construction of designs (s', 4, 1) possessing a partition into s complete s-arcs. This gives a

Partitioning Steiner triple systems into
Partitioning Steiner triple systems into complete arcs
โœ C.J. Colbourn; K.T. Phelps; M.J. de Resmini; A. Rosa ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 713 KB

Colbourn, C.J., K.T. Phelps, M.J. de Resmini and A. Rosa, Partitioning Steiner triple systems into complete arcs, Discrete Mathematics 89 (1991) 149-160. For a Steiner triple system of order v to have a complete s-arc one must have s(s + 1)/2 3 v with equality only if s = 1 or 2 mod 4. To partition

Maximum distance holey packings of type
Maximum distance holey packings of type 3n with triples
โœ J. Wang; Y. Lu; J. Yin ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 115 KB

Maximum distance holey packings of type g n with triples, MDHP(2, 3, n, g)'s, are equivalent to optimal g 1-ary (n, 3, 3) codes. The problem of existence of MDHP(2, 3, n, 2)'s has been settled completely. For g 3, only the case of odd n has been investigated. With the aid of a computer, we provides