All group‐based latin squares possess near transversals
From MaRDI portal
(Redirected from Publication:6187426)
Abstract: In a latin square of order , a near transversal is a collection of cells which intersects each row, column, and symbol class at most once. A longstanding conjecture of Brualdi, Ryser, and Stein asserts that every latin square possesses a near transversal. We show that this conjecture is true for every latin square that is main class equivalent to the Cayley table of a finite group.
Recommendations
Cites work
- A Combinatorial Problem on Abelian Groups
- A lower bound for the length of a partial transversal in a Latin square
- A note on finite abelian groups
- A random construction for permutation codes and the covering radius
- Complete mappings of finite groups
- Covering radius for sets of permutations
- Covering radius in the Hamming permutation space
- Degree conditions for matchability in 3-partite hypergraphs
- Harmonious groups
- How many colors guarantee a rainbow matching?
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 6473829 (Why is no real title available?)
- On the chromatic index of Latin squares
- On the chromatic number of Latin square graphs
- Orthogonal Latin squares based on groups
- Rainbow matchings in r-partite r-graphs
- Reduction of the Hall-Paige conjecture to sporadic simple groups.
- Sequenceable groups and related topics.
- Sequencing certain dihedral groups
- Some Results in the Theory of Quasigroups
- The admissibility of sporadic simple groups.
- The chromatic number of finite group Cayley tables
- Transversals in Latin squares: a survey
This page was built for publication: All group‐based latin squares possess near transversals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6187426)