2021/12/10 by Araya, M., Tokihisa, N.
#05B15 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2112.05262
E. R. Lamken prove in [5] that there exists a partitioned balanced tournament design of side n, PBTD(n), for n a positive integer, n ≥ 5, except possibly for n ∈ \9,11,15\. In this article, we show the existence of PBTD(n) for n ∈ \9,11,15\. As a consequence, the existence of PBTD(n) has been completely determined.