Hostname: page-component-cb9f654ff-5kfdg Total loading time: 0 Render date: 2025-08-31T03:05:48.669Z Has data issue: false hasContentIssue false
  • English
  • Français

On the completion of latin rectangles to symmetric latin squares

Part of: Designs and configurations

Published online by Cambridge University Press:  09 April 2009

Darryn Bryant  and
C. A. Rodger
Darryn Bryant
Affiliation:
Department of Mathematics, University of QueenslandQld 4072, Australia, e-mail: db@mahs.uq.edu.au
C. A. Rodger
Affiliation:
School of Mathematical and Physical Sciences, University of NewcastleNSW 2308, Australia, e-mail: rodgec1@auburn.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We find necessary and sufficient conditions for completing an arbitrary 2 by n latin rectangle to an n by n symmetric latin square, for completing an arbitrary 2 by n latin rectangle to an n by n unipotent symmetric latin square, and for completing an arbitrary 1 by n latin rectangle to an n by n idempotent symmetric latin square. Equivalently, we prove necessary and sufficient conditions for the existence of an (n−1)-edge colouring of Kn (n even), and for n-edge colouring of Kn (n odd) in which the colours assigned to the edges incident with two vertices are specified in advance.

MSC classification

Secondary: 05B15: Orthogonal arrays, Latin squares, Room squares

Information

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 76 , Issue 1 , February 2004 , pp. 109 - 124
Copyright
Copyright © Australian Mathematical Society 2004

References

[1]Andersen, L. D., ‘Embedding latin squares with prescribed diagonal’, in: Algebraic and geometric combinatorics, North-Holland Math. Stud. 65 (North-Holland, Amsterdam, 1982) pp. 9–26.CrossRefGoogle Scholar
[2]Colbourn, C. J. and Dinitz, J. H., CRC handbook of combinatorial designs (CRC Press, Boca Raton FL, 1996).CrossRefGoogle Scholar
[3]Cruse, A. B., ‘On embedding incomplete symmetric latin squares’, J. Combin. Theory Ser. A 16 (1974), 18–22.CrossRefGoogle Scholar
[4]Hall, P., ‘On representation of subsets’, J. London Math. Soc. 10 (1935), 26–30.CrossRefGoogle Scholar
[5]Rodger, C. A., ‘Embedding incomplete idempotent latin squares’, in: Combinatorial mathematics, X (Adelaide, 1982), Lecture Notes in Math. 1036 (Springer, Berlin, 1983) pp. 355–366.CrossRefGoogle Scholar
[6]Rodger, C. A., ‘Embedding an incomplete latin square in a latin square with a prescribed diagonal’, Discrete Math. (1) 51 (1984), 73–89.CrossRefGoogle Scholar
[7]Smetaniuk, B., ‘A new construction on latin squares - I: A proof of the Evans conjecture’, Ars Combin. 11 (1981), 155–172.Google Scholar