Minimal pairwise balanced designs

DOI10.1016/0012-365X(89)90370-1MaRDI QIDQ908918zbMATH OpenFDO

Authors R. G. Stanton

Publication date 1989

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(89)90370-1

zbMATH Keywords

lenth of a blocklongest blockpairwise balanced designPBD

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) General block designs in finite geometry (51E05)

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.

Recommendations

• Pairwise balanced designs on 4s+1 points with longest block of cardinality 2s
• A census of minimal pair-coverings with restricted largest block length
• scientific article; zbMATH DE number 1750099
• scientific article; zbMATH DE number 5077173
• scientific article; zbMATH DE number 1802813

Cites work

• scientific article; zbMATH DE number 3946151 (Why is no real title available?)
• scientific article; zbMATH DE number 3743276 (Why is no real title available?)
• scientific article; zbMATH DE number 3797758 (Why is no real title available?)
• The λ-μ Problem

Cited in

(8)

• Minimal clique partitions and pairwise balanced designs
• A retrospective look at the Erdös-DeBruijn theorem
• Pairwise balanced designs on 4s+1 points with longest block of cardinality 2s
• Pairwise balanced designs and sigma clique partitions
• A census of minimal pair-coverings with restricted largest block length
• scientific article; zbMATH DE number 4021145 (Why is no real title available?)
• scientific article; zbMATH DE number 4089555 (Why is no real title available?)
• Efficient paired choice designs with fewer choice pairs

This page was built for publication: Minimal pairwise balanced designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q908918)