AbstractHedayat and Hwang (J. Combin. Theory Ser. A, 36 (1984), 163–173) studied the support sizes for BIB designs with ν = 8 and k = 4. They established the existence or nonexistence for all possible support sizes, with the exceptions of 15, 16, 17, and 19. We will show that there are no such BIB designs with support sizes 15 and 16, while there are designs with support sizes 17 and 19. These latter designs require at least 42 blocks. In addition, we will provide an answer to their question on self-complementary designs
AbstractThis paper gives 43 new BIBDs (balanced incomplete block designs); most of them have r ⩽ 41 ...
This thesis presents the applications of Combinatorics in a Balanced Incomplete Block Design (B.I.B....
AbstractThis paper deals with existence results for pairwise balanced designs with block sizes 8, 9,...
AbstractThe set of all distinct blocks of a BIB design is referred to as the support of the design. ...
AbstractThis paper deals with methods of constructing new BIB designs from known designs. First, we ...
AbstractIf there are less than b distinct blocks in a BIB design with b blocks then we say the desig...
AbstractIt is unknown whether a BIB design with parameters (22, 33, 12, 8, 4) exists or not. In this...
ABSTRACT W The set of distinct of a block design is known as its support. 3e construct a BIB design ...
AbstractIn this paper, some μ-resolvable balanced incomplete block designs are constructed. Furtherm...
When trying to enumerate all BIBD-s for given parameters, their natural solution space appears to be...
A method of constructing a series of p-resolvable BIB designs from mutually orthogonal mates of BIB ...
AbstractThis paper surveys some new results and constructions on BIBDs and related designs including...
AbstractA balanced incomplete block design (BIBD) B[k,λ;υ] is an arrangement of υ elements in blocks...
AbstractIn statistical planning of experiments, super-simple designs are the ones providing samples ...
A unified-method of construction of BIB designs with v = 2k is described. The method follovJs from ~...
AbstractThis paper gives 43 new BIBDs (balanced incomplete block designs); most of them have r ⩽ 41 ...
This thesis presents the applications of Combinatorics in a Balanced Incomplete Block Design (B.I.B....
AbstractThis paper deals with existence results for pairwise balanced designs with block sizes 8, 9,...
AbstractThe set of all distinct blocks of a BIB design is referred to as the support of the design. ...
AbstractThis paper deals with methods of constructing new BIB designs from known designs. First, we ...
AbstractIf there are less than b distinct blocks in a BIB design with b blocks then we say the desig...
AbstractIt is unknown whether a BIB design with parameters (22, 33, 12, 8, 4) exists or not. In this...
ABSTRACT W The set of distinct of a block design is known as its support. 3e construct a BIB design ...
AbstractIn this paper, some μ-resolvable balanced incomplete block designs are constructed. Furtherm...
When trying to enumerate all BIBD-s for given parameters, their natural solution space appears to be...
A method of constructing a series of p-resolvable BIB designs from mutually orthogonal mates of BIB ...
AbstractThis paper surveys some new results and constructions on BIBDs and related designs including...
AbstractA balanced incomplete block design (BIBD) B[k,λ;υ] is an arrangement of υ elements in blocks...
AbstractIn statistical planning of experiments, super-simple designs are the ones providing samples ...
A unified-method of construction of BIB designs with v = 2k is described. The method follovJs from ~...
AbstractThis paper gives 43 new BIBDs (balanced incomplete block designs); most of them have r ⩽ 41 ...
This thesis presents the applications of Combinatorics in a Balanced Incomplete Block Design (B.I.B....
AbstractThis paper deals with existence results for pairwise balanced designs with block sizes 8, 9,...