Skip to main content
Log in

Edge-coloured designs with block size four

  • Research Papers
  • Published:
aequationes mathematicae Aims and scope Submit manuscript

Summary

The existence of edge-coloured block designs with block size four is studied for all nonisomorphic colourings of the edges of aK 4. There are 25 nonisomorphic edge-colouredK 4's; for each, we examine the existence of edge-coloured designs with the minimum possible index. Uniform cases lead to block designs, perpendicular arrays, nested Steiner triple systems, idempotent Schroeder quasigroups, and other combinatorial objects.

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. Bermond, J.-C. andSotteau, D.,Graph decompositions and G-designs. In:Proc. Fifth British Combinatorial Conf. (Univ. Aberdeen, 1975). Utilitas Math., Winnipeg, 1976, pp. 53–72.

    Google Scholar 

  2. Beth, T., Jungnickel, D. andLenz, H.,Design theory. Bibliographisches Institut, Mannheim, 1985.

    Google Scholar 

  3. Brayton, R. K., Coppersmith, D. andHoffman, A. J.,Self-orthogonal Latin squares of all orders n ≠ 2, 3,or 6. Bull. Amer. Math. Soc.80 (1974), 116–118.

    Google Scholar 

  4. Brouwer, A. E., Hanani, H. andSchrijver, A.,Group divisible designs with block size four. Discrete Math.20 (1977), 1–10.

    Google Scholar 

  5. Gibbons, P. B.,Computing techniques for the construction and analysis of block designs. Ph.D. thesis, University of Toronto, 1975.

  6. Granville, A., Mosiadis, A. andRees, R.,On complementary decompositions of the complete graph (to appear).

  7. Hanani, H.,The existence and construction of balanced incomplete block designs. Ann. Math. Statist.32 (1961), 361–386.

    Google Scholar 

  8. Hanani, H. Ray Chaudhuri, D. K. andWilson, R. M.,On resolvable designs. Discrete Math.3 (1972), 343–357.

    Google Scholar 

  9. Hell, P. andRosa, A.,Graph decompositions, handcuffed prisoners and balanced p-designs. Discrete Math.2 (1972), 229–252.

    Google Scholar 

  10. Kirkman, T. P.,On a problem in combinations. Cambridge and Dublin Math. M.2 (1847), 191–204.

    Google Scholar 

  11. Lindner C. C., Mendelsohn, N. S. andSun, S. R.,On the construction of Schroeder quasigroups. Discrete Math.32 (1980), 271–280.

    Google Scholar 

  12. Lindner C. C., Mullin, R. C. andStinson D. R.,On the spectrum of resolvable orthogonal arrays invariant under the Klein group K 4. Aequationes Math.26 (1983), 176–183.

    Google Scholar 

  13. Lindner, C. C., Mullin, R. C. andvan Rees G. H. J.,Separable orthogonal arrays. Utilitas Math.31 (1987), 24–32.

    Google Scholar 

  14. Mullin, R. C., Schellenberg, P. J., van Rees, G. H. J. andVanstone S. A.,On the construction of perpendicular arrays. Utilitas Math.18 (1980), 141–160.

    Google Scholar 

  15. Stinson, D. R.,The spectrum of nested Steiner triple systems. Graphs Combins.1 (1985), 189–191.

    Google Scholar 

  16. Wilson, R. M.,An existence theory for coloured block designs. Presented at the Colloquium on Algebraic Combinatorics, Montreal, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Colbourn, C.J., Stinson, D.R. Edge-coloured designs with block size four. Aeq. Math. 36, 230–245 (1988). https://doi.org/10.1007/BF01836093

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

AMS (1980) subject classification

Navigation