The necessary conditions for the existence of a resolvable BIBD RB(k, A; v) are A(v -I) = O(mod k -1) and v = O(mod k). In this article, it is proved that these conditions are also sufficient for k = 8 and A = 7, with at most 36 possible exceptions.
A near resolvable design, NRB(v, k), is a balanced incomplete block design whose block set can be partitioned into v classes such that each class contains every point of the design but one, and each point is missing from exactly one class. The necessary conditions for the existence of near resolvable designs are v = 1 mod k and A = k -1. These necessary conditions have been shown to be sufficient for k E {2,3,4} and almost always sufficient for k E (56). We are able to show that there exists an integer n&) so that NRB(v,k) exist for all v > no@) and v = 1 mod k. Using some new direct constructions we show that there are many k for which it is easy to compute an explicit bound on no(&). These direct constructions also allow us to build previously unknown NRB(v, 5 ) and NRB(v, 6). 0 1995 John Wiley 81 Sons, he.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.