Minimal pairwise balanced designs
type: Item
instance of: scholarly article
title: Minimal pairwise balanced designs
zbMATH Open document ID: 0694.05008
DOI: 10.1016/0012-365X(89)90370-1
published in: Discrete Mathematics
publication date: 1989-01-01T00:00:00Z
review text: Consider a pairwise balanced design on v elements with \(\lambda =1\) in which k denotes the size of the longest block(s). The minimum number of blocks in such a design is denoted by \(g^{(k)}(1,2;v)\). By some counting arguments and algebraic manipulations the author obtains an expression for \(g^{(k)}(1,2;v)\) involving a certain remainder term. From this expression he derives earlier bounds and other results in a rather unified way.
Mathematics Subject Classification ID: 05B05
Mathematics Subject Classification ID: 51E05
zbMATH DE Number: 4135948
zbMATH Keywords: lenth of a block
zbMATH Keywords: PBD
zbMATH Keywords: pairwise balanced design
zbMATH Keywords: longest block
author: R. G. Stanton
reviewed by: A. Bonisoli
MaRDI profile type: Publication
cites work: Q3717066
cites work: Q3929754
cites work: Q4742790
cites work: The λ-μ Problem
description: scientific article; zbMATH DE number 4135948