A generalization of transversals for Latin squares
A \(k\)-plex is a partial Latin square of order \(n\) such that each row and each column has exactly \(k\) cells filled, and each entry occurs precisely \(k\) times. A \(1\)-plex is a transversal, a particularly important notion in the theory of Latin squares (a Latin square has an orthogonal partner if and only if it can be decomposed into transversals). The paper is a detailled study of plexes and includes interesting historical notes. An easy result says that \(k\)-plexes always exist \((k\leq n).\) More challenging is the proof of the fact that for \(k>n/4\) there always exists a \(k\)-plex of order \(n\) which cannot be completed to a Latin square. A conjecture states that this result is sharp (every \(k\)-plex of order \(n\) should be completable if \(k\leq n/4\)). NEWLINENEWLINENEWLINESpecial cases of Latin squares are multiplication tables of groups. A peculiar situation arises when the group \(G\) has a normal \(2\)-complement. This is the case in particular when the Sylow-\(2\)-subgroup of \(G\) is cyclic. Latin squares of \(q\)-step type are a combinatorial generalization of this situation. The corresponding group tables do not possess any \(k\)-plexes for odd \(k,\) but do possess \(k\)-plexes for all even \(k.\) NEWLINENEWLINENEWLINERather complete enumeration results are given for plexes in Latin squares of orders up to \(8.\) These results are interesting in the light of a theorem by \textit{K. Balasubramanian} [Linear Algebra Appl. 131, 125-129 (1990; Zbl 0704.05007)] who showed that Latin squares of even order have an even number of transversals. The enumeration in the case of these small orders shows that several conceivable generalizations of this result are not true. This refutes in particular an old conjecture of Ryser stating that each Latin square of odd order has an odd number of transversals. A new conjecture states that each Latin square of even order can be decomposed into \(2\)-plexes.
- Transversals in generalized Latin squares
- On transversals in Latin squares
- Transversals in Latin squares: a survey
- On transversals of homogeneous Latin squares
- scientific article; zbMATH DE number 4061257
- Transversals in Latin Squares
- On the number of transversals in a class of Latin squares
- On the number of transversals in Latin squares
- Transversals of additive Latin squares
- scientific article; zbMATH DE number 1161383
- Indivisible plexes in Latin squares
- Balanced diagonals in frequency squares
- The chromatic number of finite group Cayley tables
- Parity of transversals of Latin squares
- Completion and deficiency problems
- Latin squares with maximal partial transversals of many lengths
- Refining invariants for computing autotopism groups of partial Latin rectangles
- Latin squares with no transversals
- Clique decompositions of multipartite graphs and completion of Latin squares
- Covers and partial transversals of Latin squares
- On the chromatic number of Latin square graphs
- Enumeration of MOLS of small order
- Completions of -dense partial Latin squares
- scientific article; zbMATH DE number 5818964 (Why is no real title available?)
- Bachelor Latin squares with large indivisible plexes
- Latin squares with restricted transversals
- Latin squares with restricted transversals
- \(k\)-splitted and \(k\)-homogeneous Latin squares and their transversals
- Latin squares with no small odd plexes
- Longest partial transversals in plexes
- A natural generalization of orthogonality of Latin squares
- Transversals in splitted Latin squares of even order
- Restricted completion of sparse partial Latin squares
- A generalization of plexes of Latin squares
- Orientable Hamilton cycle embeddings of complete tripartite graphs. I: Latin square constructions
- Transversals in Latin Squares
- k-однородные латинские квадраты, их трансверсали и условие ортогональности
- Hamilton transversals in random Latin squares
- $k$-однородные латинские квадраты, их трансверсали и условие псевдоортогональности;$k$-homogeneous Latin Squares, their transversals and condition of pseudo-orthogonality
- How to burn a Latin square
- Indivisible partitions of Latin squares
- Maximum transversal in partial Latin squares and rainbow matchings
This page was built for publication: A generalization of transversals for Latin squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5960787)
