Asymptotic existence of frame-GBTDs (Q498123)

For the necessary terminologies and notation of design theory we refer to [\textit{C. J. Colbourn} (ed.) and \textit{J. H. Dinitz} (ed.), The CRC handbook of combinatorial designs. 2nd ed. Boca Raton, FL: Chapman \& Hall/CRC (2007; Zbl 1101.05001)], and [\textit{D. R. Stinson}, Combinatorial designs. Constructions and analysis. New York, NY: Springer (2004; Zbl 1031.05001)]. The generalized balanced tournament designs (GBTDs) can be thought of a group divisible design (GDD) in one way, and also as an equivalent characterization of a class of equitable symbol weight codes the other way. The constructions of these GBTDs can be seen numerously in the literature, and with the inspiration of these constructions, the authors established an asymptotic theorem for frame GBTDs of type \(g^n\) and block size \(k\) via decompositions of edge-colored complete digraphs into edge-colored sub graphs, which has been stated hereunder as: ``Given fixed positive integers \(k\) and \(g\) with \(k \geq 2\) and \(k | g\), there exists a constant \(n_0 = n_0(g,k)\) such that \(\operatorname{FGBTD}(k,g^n)\)s exist for all integers \(n \geq n_0\).'' They prove this using a powerful theorem by \textit{E. R. Lamken} and \textit{R. M. Wilson} [J. Comb. Theory, Ser. A 89, No. 2, 149--200, Art. No. jcta.1999.3005 (2000; Zbl 0937.05064)].