Skip to main content
Log in

Existence of (2, 8) GWhD(v) and (4, 8) GWhD(v) with \({v \equiv 0,1 (mod 8)}\)

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

(2, 8) Generalized Whist tournament Designs (GWhD) on v players exist only if \({v \equiv 0,1 (mod 8)}\) . We establish that these necessary conditions are sufficient for all but a relatively small number of (possibly) exceptional cases. For \({v \equiv 1 (mod 8)}\) there are at most 12 possible exceptions: {177, 249, 305, 377, 385, 465, 473, 489, 497, 537, 553, 897}. For \({v \equiv 0 (mod 8)}\) there are at most 98 possible exceptions the largest of which is v = 3696. The materials in this paper also enable us to obtain four previously unknown (4, 8)GWhD(8n+1), namely for n = 16,60,191,192 and to reduce the list of unknown (4, 8) GWhD(8n) to 124 values of v the largest of which is v = 3696.

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

Access this article

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. Abel R.J.R.: On the existence of balanced incomplete block designs and transversal designs. Ph.D. thesis, University of New South Wales, Sydney (1995).

  2. Abel R.J.R., Colbourn C.J., Dinitz J.H.: Mutually orthogonal latin squares (MOLS). In: Colbourn, C.J., Dinitz, J.H.(eds) The CRC Handbook of Combinatorial Designs, 2nd edn. pp. 160–193. CRC Press, Boca Raton, FL (2006)

    Google Scholar 

  3. Abel R.J.R., Cheng Y.W.: Some new MOLS of order 2n . p for p a prime power. Australas. J. Combin. 10, 175–186 (1994)

    MATH  MathSciNet  Google Scholar 

  4. Abel R.J.R., Finizio N.J., Greig M., Lewis S.J.: Generalized whist tournament designs. Discrete Math. 268, 1–19 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Abel R.J.R., Finizio N.J., Greig M., Lewis S.J.: Pitch tournament designs and other BIBDs – existence results for the case v = 8n + 1. Congr. Numer. 138, 175–192 (1999)

    MATH  MathSciNet  Google Scholar 

  6. Abel R.J.R., Finizio N.J., Greig M., Lewis S.J.: Pitch tournament designs and other BIBDs – existence results for the case v = 8n. J. Combin. Des. 9, 334–356 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  7. Abel R.J.R., Greig M., Miao Y., Zhu L.: Resolvable BIBDs with block size 7 and index 6. Discrete Math. 226, 1–20 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. Anderson I.: Combinatorial Designs and Tournaments. Oxford University Press, Oxford (1997)

    MATH  Google Scholar 

  9. Anderson L.: Factorizations of graphs. In: Colbourn, C.J., Dinitz, J.H.(eds) The CRC Handbook of Combinatorial Designs, 2nd edn. pp. 740–755. CRC Press, Boca Raton, FL (2006)

    Google Scholar 

  10. Brouwer A.E.: A series of separable designs with application to pairwise orthogonal Latin squares. Eur. J. Combin. 1, 39–41 (1980)

    MATH  MathSciNet  Google Scholar 

  11. Buratti M., Finizio N.J., Greig M., Travers B.J.: \({\mathbb{Z}}\) -cyclic (t,8) GWhD(v), t = 2, 4. Utilitas Math. 72, 125–138 (2007)

    MATH  MathSciNet  Google Scholar 

  12. Denniston R.H.F.: Some maximal arcs in finite projective planes. J. Combin. Theory 6, 317–319 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  13. Finizio N.J., Lewis S.J.: Pitch tournament designs. Congr. Numer. 130, 19–27 (1998)

    MATH  MathSciNet  Google Scholar 

  14. Finizio N.J., Lewis S.J.: Some specializations of pitch tournament designs. Utilitas Math. 56, 33–52 (1999)

    MATH  MathSciNet  Google Scholar 

  15. Furino S., Miao Y., Yin J.: Frames and Resolvable Designs: Uses, Constructions, and Existence. CRC Press, Boca Raton, FL (1996)

    MATH  Google Scholar 

  16. Greig M.: Designs from projective planes, and PBD bases. J. Combin. Des. 7, 341–374 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  17. Greig M.: Some pairwise balanced designs. Electron. J. Combin. 7, R13 (2000)

    MathSciNet  Google Scholar 

  18. Greig M.: Log tables and block designs. Bull. Inst. Combin. Appl. 48, 66–72 (2006)

    MATH  MathSciNet  Google Scholar 

  19. Seiden E.: A method of construcftion of resolvable BIBD. Sankhyá Ser. A 25, 393–394 (1963)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to R. Julian R. Abel.

Additional information

Communicated by J.D. Key.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Abel, R.J.R., Finizio, N.J., Greig, M. et al. Existence of (2, 8) GWhD(v) and (4, 8) GWhD(v) with \({v \equiv 0,1 (mod 8)}\) . Des. Codes Cryptogr. 51, 79–97 (2009). https://doi.org/10.1007/s10623-008-9245-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-008-9245-z

Keywords

MathematicS Subject Classification (2000)

Navigation