Hamiltonian double Latin squares
A double Latin square (DLS) of order \(2n\) is a matrix of order \(2n\) in which each of \(n\) symbols occurs exactly twice in each row and twice in each column. Thus a DLS is a particular type of frequency square. In a natural way, each DLS of order \(2n\) encodes a 2-factorisation of the complete bipartite graph \(K_{2n,2n}\). If every 2-factor in that 2-factorisation is a Hamiltonian cycle then the authors say that the DLS in question is an HLS (short for Hamiltonian double Latin square). The concept is similar to one studied by \textit{I. M. Wanless} [Electron. J. Comb. 6, Research paper R9 (1999; Zbl 0915.05023)] and \textit{D. Bryant} et al. [J. Comb. Theory, Ser. A 98, 328-342 (2002; Zbl 1003.05081)]. Both of those papers studied Latin squares (of the ordinary variety, rather than DLSs) which encode perfect 1-factorisations of complete bipartite graphs. The present paper is lengthy and covers a number of different aspects of HLSs, including: (a) Methods of construction, such as a diagonally cyclic method reminiscent of the work of \textit{M. F. Franklin} [Ars Comb. 17, 129-139 (1984; Zbl 0557.05017)]. (b) Orthogonality (in the usual sense for frequency squares). For example, it is shown that for all \(n\geq 2\) there exists a pair of orthogonal HLSs of order \(2n\). (c) Connections with graph theory. It has already been mentioned that a HLS of order \(2n\) encodes a Hamiltonian decomposition of \(K_{2n,2n}\). It is also true that a symmetric HLS of order \(2n\) encodes a Hamiltonian decomposition of \(K_{2n+1}\). Hence many of the results of the paper may be interpreted in graph theoretic terms and many of the proofs are graph theoretic or even matroid theoretic in nature. (d) Embedding results for partial HLSs. Many of these results are proved by the method of amalgamation and detachment.
- A family of perfect factorisations of complete bipartite graphs
- A method for constructing symmetric Hamiltonian double Latin squares
- A tripling construction for mutually orthogonal symmetric Hamiltonian double Latin squares
- Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
- Atomic Latin squares of order eleven
- Atomic Latin squares based on cyclotomic orthomorphisms
- Embedding cyclic Latin squares of order 2^ n in a complete set of orthogonal F-squares
- Cycles of quadratic Latin squares and antiperfect 1‐factorisations
- scientific article; zbMATH DE number 1556753
- Orthogonal factor‐pair Latin squares of prime‐power order
- F-Square and Orthogonal F-Squares Design: A Generalization of Latin Square and Orthogonal Latin Squares Design
- A Combinatorial Theorem with an Application to Latin Rectangles
- A family of perfect factorisations of complete bipartite graphs
- A Solution to the Embedding Problem for Partial Idempotent Latin Squares
- Amalgamations of almost regular edge-colourings of simple graphs
- Embedding Incomplete Latin Squares
- Further contributions to the theory of F-squares design
- Generalized latin rectangles. II: Embedding
- Hamiltonian decompositions of complete graphs
- Hamiltonian decompositions of complete regular s-partite graphs
- scientific article; zbMATH DE number 4173021 (Why is no real title available?)
- scientific article; zbMATH DE number 4025452 (Why is no real title available?)
- scientific article; zbMATH DE number 124514 (Why is no real title available?)
- scientific article; zbMATH DE number 3478938 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 3378938 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- On embedding incomplete symmetric Latin squares
- Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
- Thank Evans!
- Hamiltonicity in vertex envelopes of plane cubic graphs
- Amalgamating infinite Latin squares
- A quantitative approach to perfect one-factorizations of complete bipartite graphs
- On the vertices of the d-dimensional Birkhoff polytope
- A method for constructing symmetric Hamiltonian double Latin squares
- Some \(\mathbb Z_{n-2}\) terraces from \(\mathbb Z_n\) power-sequences, \(n\) being an odd prime power
- A tripling construction for mutually orthogonal symmetric Hamiltonian double Latin squares
- Hamilton transversals in random Latin squares
- Doubly sequenceable groups
- On decomposability of 4-ary distance 2 MDS codes, double-codes, and \(n\)-quasigroups of order 4
This page was built for publication: Hamiltonian double Latin squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1403912)
