Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Orthogonal resolutions in odd balanced tournament designs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

An odd balanced tournament design,OBTD(n), is ann × 2n + 1 array of pairs defined on a (2n + 1)-setV such that (1) every row of the array contains each element ofV twice, (2) every column of the array contains 2n distinct elements ofV, and (3) the pairs of the array form a (2n + 1, 2, 1)-BIBD. In this paper, we investigate the spectrum of odd balanced tournament designs with orthogonal resolutions. These designs can be used to construct doubly near resolvable (v, 3, 2)-BIBDs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bruck, R.H.: What is a loop? In: Studies in Modern Algebra, Prentice-Hall 1963

  2. Chong, B.C., Chan, K.M.: On the existence of normalized Room squares. Nanta Math.7, 8–17 (1974)

    Google Scholar 

  3. Dinitz, J.H., Stinson, D.R.: The spectrum of Room cubes. Europ. J. Comb.2, No. 3, 221–230 (1981)

    Google Scholar 

  4. Dinitz, J.H., Stinson, D.R.: On Howell designs of odd side. Utilitas Math.18, 207–216 (1980)

    Google Scholar 

  5. Gross, K.B.: A multiplication theorem for strong starters. Aequationes Math.11, 169–173 (1974)

    Google Scholar 

  6. Gross, K.B., Leonard, P.A.: The existence of strong starters in cyclic groups. Utilitas Math.7, 187–195 (1975)

    Google Scholar 

  7. Gross, K.B., Mullin, R.C., Wallis, W.D.: The number of pairwise orthogonal symmetric Latin squares. Utilitas Math.4, 239–251 (1973)

    Google Scholar 

  8. Horton, J.D.: Quintuplication of Room squares. Aequationes Math.7, 243–245 (1971)

    Google Scholar 

  9. Horton, J.D.: Room designs and one-factorizations. Aequationes Math.22, 56–63 (1981)

    Google Scholar 

  10. Lamken, E.R., Vanstone, S.A.: Balanced tournament designs and resolvable (v, 3, 2)-BIBDs. Discrete Math. (to appear)

  11. Lamken, E.R., Vanstone, S.A.: Skew transversals in frames. J. of Combinatorial Math. and Combinatorial Computing. (to appear)

  12. Mullin, R.C., Wallis, W.D.: The existence of Room squares. Aequationes Math.13, 1–7 (1975)

    Google Scholar 

  13. Mullin, R.C., Nemeth, E.: An existence theorem for Room squares. Canadian Math. Bull.12, 493–497 (1969)

    Google Scholar 

  14. Mullin, R.C., Schellenberg, P.J., Vanstone, S.A., Wallis, W.D.: On the existence of frames, Discrete Math.37, 79–104 (1981)

    Google Scholar 

  15. Schellenberg, P.J., van Rees, G.H.J., Vanstone, S.A.: The existence of balanced tournament designs. Ars Combinatoria3, 303–318 (1977)

    Google Scholar 

  16. Stinson, D.R., Some Classes of Frames and the Spectrum of Skew Room squares and Howell Designs. Ph.D. Thesis. Univ. of Waterloo, Waterloo, Ontario. 1981

    Google Scholar 

  17. Stinson, D.R., Zhu, L.: On sets of three MOLS with holes. Discrete Math.54, 321–328 (1985)

    Google Scholar 

  18. Vanstone, S.A.: Doubly resolvable designs, Discrete Math.29, 77–86 (1980)

    Google Scholar 

  19. Wallis, W.D.: Room Squares. In: Combinatorics: Room squares, sum-free sets, Hadamard matrices, (Lecture Notes in Mathematics 292), Berlin: Springer-Verlag 1972

    Google Scholar 

  20. Wang, S.M.P., Wilson, R.M.: A few more squares (abstract). Proc. 9th Southeastern Conf. on Combinatorics, Graph Theory and Computing, Boca Raton, FL. 688 (1978)

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lamken, E.R., Vanstone, S.A. Orthogonal resolutions in odd balanced tournament designs. Graphs and Combinatorics 4, 241–255 (1988). https://doi.org/10.1007/BF01864165

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01864165

Keywords