The existence of court balanced tournament designs (Q1336700)

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\).