Existence of DBIBDs with block size not divided by four (Q1579545)

A directed balanced incomplete block design \(\text{DB}(v,k,\lambda)\) is a pair \((X,A)\), where \(X\) is a \(v\)-set and \(A\) is a collection of transitively ordered \(k\)-tuples of \(X\) (called blocks) such that every ordered pair of \(X\) appears in exactly \(\lambda\) blocks of \(A\). If \(k\) and \(\lambda\) are integers, \(k\geq 3\), \(\lambda\geq 1\), let \(c_d(k,\lambda)\) denote the smallest integer such that the necessary conditions \(2\lambda(v-1)\equiv 0\pmod{k-1}\) and \(\lambda v(v-1)\equiv 0\pmod{{k\choose 2}}\) for the existence of a \(\text{DB}(v,k,\lambda)\) are also sufficient for all \(v\geq c_k(k,\lambda)\). The authors provide an estimate for \(c_k(k,\lambda)\) when \(k\not\equiv 0\pmod 4\).