Affordable Access

Publisher Website

Constructions for generalized balanced tournament designs

Authors
Journal
Discrete Mathematics
0012-365X
Publisher
Elsevier
Publication Date
Volume
131
Identifiers
DOI: 10.1016/0012-365x(94)90379-4
Disciplines
  • Design

Abstract

Abstract A generalized balanced tournament design, GBTD( n, k), defined on a kn-set V, is an arrangement of the blocks of a ( kn, k, k−1)-BIBD defined on V into an n×( kn−1) array such that (1) every element of V is contained in precisely one cell of each column, and (2) every element of V is contained in at most k cells of each row. In this paper, we describe several constructions, both direct and recursive, for generalized balanced tournament designs. We include special cases of these constructions which can be used to produce factored and partitioned generalized balanced tournament designs.

There are no comments yet on this publication. Be the first to share your thoughts.