Embeddings of simple maximum packings of triples with λ even
✍ Scribed by Salvatore Milici; Gaetano Quattrocchi; Hao Shen
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 470 KB
- Volume
- 145
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
## Abstract In this paper, we present a conjecture that is a common generalization of the Doyen–Wilson Theorem and Lindner and Rosa's intersection theorem for Steiner triple systems. Given __u__, __v__ ≡ 1,3 (mod 6), __u__ < __v__ < 2__u__ + 1, we ask for the minimum __r__ such that there exists a
Let (X; B) be a -fold block design with block size four and deÿne sets B(C) and E(K4 \ C) as follows: for each block b ∈ B, partition b into a 4-cycle and a pair of disjoint edges and place the 4-cycle in B(C) and the 2 disjoint edges in E(K4 \ C). If we can reassemble the edges belonging to E(K4 \