Coloring BIBDs with block size 4
✍ Scribed by Václav Linek; Evan B. Wantland
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 394 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
For k ! 3 the existence problem forvY 7Y k BIBDs has been completely solved, except when v 253. In this paper, 3 new direct vY 7Y k BIBD constructions are given for vY k 259Y 1Y 106Y 2Y and 253Y 2. Some features of the known 175Y 7Y 1 BIBD are also discussed. Finally, a few vY 7Y 1 BIBDs are obtaine
## Abstract In this paper we give some results on cyclic BIBDs with block size 4. It is proved that a cyclic __B__(4,1;4__^n^ u__) exists where __u__ is a product of primes congruent to 1 modulo 6 and __n__ is a positive integer and __n__ ≥ 3. In the case of __n__ = 2, we also give some partial res
## Abstract The necessary conditions for the existence of a resolvable BIBD RB(__k__,λ; __v__) are λ(__v__ − 1) = 0(mod __k__ − 1) and __v__ = 0(mod __k__). In this article, it is proved that these conditions are also sufficient for __k__ = 8 and λ = 7, with at most 36 possible exceptions. © 1994 J
## Abstract In a (__v, k__, λ: __w__) incomplete block design (IBD) (or PBD [__v, {k, w__^\*^}. λ]), the relation __v__ ≥ (__k__ − 1)__w__ + 1 must hold. In the case of equality, the IBD is referred to as a block design with a large hole, and the existence of such a configuration is equivalent to t