Abstract
A near generalized balanced tournament design, or an NGBTD(k,m) in short, is a (km + 1, k, k − 1)-BIBD defined on a (km +1)-set V. Its blocks can be arranged into an m × (km + 1) array in such a way that (1) the blocks in every column of the array form a partial parallel class partitioning V[x] for some point x, and (2) every element of V is contained in precise k cells of each row. In this paper, we completely solve the existence of NGBTD(4,m) and almost completely solve the existence of NGBTD(5,m) with four exceptions.
Similar content being viewed by others
References
Gelling E N, Odeh R E. On 1-factorizations of the complete graph and the relationship to round robin schedules. Congr Number, 9: 213–221 (1974)
Colbourn C J, Dinitz J H. The CRC Handbook of Combinatorial Designs, 2nd Ed. Boca Raton: CRC Press, 2006
Lamken E R. On near generalized balanced tournament designs. Discrete Math, 97: 279–294 (1991)
Yan J. Generalized doubly resolvable packings and the corresponding codes. Ph.D. thesis. Suzhou: Suzhou University, 2007
Wilson R M. Cyclotomy and difference families in elementary abelian groups. J Number Theory, 4: 17–47 (1972)
Yan J, Yin J. Constructions of optimal GDRP(n,λ;v)’s of type λ1m−1. Discrete Appl Math, 156: 2666–2678 (2008)
Yin J X, Yan J, Wang C M. Generalized balanced tournament designs and related codes. Designs, Codes and Cryptography, 46: 211–230 (2008)
Furino S. Miao Y, Yin J. Frames and Resolvable Designs. Boca Raton: CRC Press, 1996
Rosa A, Vanstone S A. Starter-adder techniques for Kirkman squares and Kirkman cubes of small sides. Ars Combin, 14: 199–212 (1982)
Yan J, Yin J. A class of optimal constant composition codes from GDRPs. Designs, Codes and Cryptography, 50: 61–76 (2009)
Lamken E R. 3-complementary frames and doubly near resolvable (v,3,2)-BIBDs. Discrete Math, 88: 59–78 (1991)
Abel R J R, Buratti M, Greig M, et al. Constructions for rotational near resolvable block designs. J Combin Design, 9: 157–181 (2001)
Ma S, Chang Y. Constructions of optimal optical orthogonal codes with weight five. J Combin Design, 13: 54–69 (2004)
Tang Y, Yin J. The combinatorial construction of a class of optimal optical orthogonal codes. Sci China Ser A, 45: 1268–1275 (2002)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by National Natural Science Foundation of China (Grant Nos. 10771051, 10831002)
Rights and permissions
About this article
Cite this article
Shan, X. Near generalized balanced tournament designs with block sizes 4 and 5. Sci. China Ser. A-Math. 52, 1927–1938 (2009). https://doi.org/10.1007/s11425-009-0023-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11425-009-0023-9
Keywords
- near generalized balanced tournament designs
- frame generalized doubly resolvable packing
- constructions
- existence