The existence of court balanced tournament designs
type: Item
instance of: scholarly article
title: The existence of court balanced tournament designs
zbMATH Open document ID: 0807.05019
DOI: 10.1016/0012-365X(94)90027-2
author: P. Rodney
author: Eric Mendelsohn
published in: Discrete Mathematics
publication date: 1994-11-03T00:00:00Z
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\).
Mathematics Subject Classification ID: 05B30
Mathematics Subject Classification ID: 05B15
zbMATH DE Number: 681699
zbMATH Keywords: court balanced tournament design
reviewed by: Ernest Jucovič
MaRDI profile type: Publication
cites work: Q4075506
cites work: A Tournament Design Problem
cites work: Balanced tournament designs and related topics
cites work: Q4184851
cites work: Q3728004
cites work: Combinatorics. Room squares, sum-free sets, Hadamard matrices
cites work: Q3337477
Recommended article: The existence of near generalized balanced tournament designs
Recommended article: Q3708036
Recommended article: Q4862343
Recommended article: Q3783308
Recommended article: Balanced tournament designs and related topics
Recommended article: On near generalized balanced tournament designs
Recommended article: Q4712496
Recommended article: Q4876940
Recommended article: Q3800065
Recommended article: Constructions for generalized balanced tournament designs
description: scientific article; zbMATH DE number 681699