Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
A Latin squares of order \(n\) is pan-Hamiltonian if every pair of rows determines a permutation consisting of a single cycle of length \(n\). This is equivalent to saying that the Latin square contains no proper subrectangles. A Latin square is atomic if its six conjugates are all pan-Hamiltonian. Also, there exists a pan-Hamiltonian Latin square of order \(n\) if and only if the complete bipartite graph \(K_{n,n}\) has a perfect 1-factorization. Pan-Hamiltonian Latin squares exist of orders \(n= p\) and \(n= 2p-1\), where \(p\) is prime; there is no such square of even order \(n\geq 4\). If the complete graph \(K_{n+ 1}\) has a perfect 1-factorization, then so does \(K_{n,n}\), and due to the conjectured existence of a perfect 1-factorization of \(K_n\) for all even \(n\), the author conjectures the existence of pan-Hamiltonian Latin squares of all odd orders \(n\). The Latin square \(C_p\) of order \(p\), where \(p\) is prime, consisting of the Caylay table for the cyclic group of order \(p\), is atomic, and the author produces an atomic square of order \(p\) outside the main class of \(C_p\) provided 2 is a primitive root modulo \(p\). The author notes the existence of atomic squares of composite order, citing the square of order 27 constructed from the perfect 1-factorization of \(K_{28}\), but knows of no non-prime power order atomic squares. The author also gives a catalog of pan-Hamiltonian Latin squares of orders up through 9.
- Matching graphs of hypercubes and complete bipartite graphs
- Hamiltonian double Latin squares
- A family of perfect factorisations of complete bipartite graphs
- A quantitative approach to perfect one-factorizations of complete bipartite graphs
- New families of atomic Latin squares and perfect 1-factorisations.
- Atomic Latin squares based on cyclotomic orthomorphisms
- Enumeration of MOLS of small order
- Permanents and determinants of Latin squares
- Perfect 1-Factorizations of a Family of Cayley Graphs
- Loops with exponent three in all isotopes
- Matching graphs of Hypercubes and Complete Bipartite Graphs
- scientific article; zbMATH DE number 4049662 (Why is no real title available?)
- Switching in one-factorisations of complete graphs
- Atomic Latin squares of order eleven
- A tripling construction for mutually orthogonal symmetric Hamiltonian double Latin squares
- Cycles of quadratic Latin squares and antiperfect 1‐factorisations
- Row‐Hamiltonian Latin squares and Falconer varieties
- Tic-Tac-Toe on designs
- Perfect 1-factorisations of \(K_{11,11}\)
This page was built for publication: Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1277147)
