The existence of court balanced tournament designs

DOI10.1016/0012-365X(94)90027-2MaRDI QIDQ1336700zbMATH OpenFDO

Authors P. Rodney, Eric Mendelsohn

Publication date 3 November 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(94)90027-2

zbMATH Keywords

court balanced tournament design

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Other designs, configurations (05B30)

Review text

Let \(V\) be a set of \(n\) elements. A court balanced tournament design \(\text{CBTD}(n,c)\) is a \(c\)-row array of the \({n\choose 2}\) pairs of elements of \(V\) such that every element appears at most once in each column and the same number of times in each row. The authors show that \(\text{CBTD}(n,c)\) exist for all \(n\) and \(c\) such that \(c\) divides \({n\choose 2}\) as well as \(n-1\).

Recommendations

Cites work

Cited in

(5)

This page was built for publication: The existence of court balanced tournament designs

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