All group‐based latin squares possess near transversals

DOI10.1002/jcd.21701arXiv1905.07071OpenAlexW3005351221MaRDI QIDQ6187426

Kevin Halasz, Luis A. Goddyn

Publication date: 31 January 2024

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.07071

zbMATH Keywords

complete mappingLatin squareCayley tablepartial transversalBrualdi's conjecture

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How many colors guarantee a rainbow matching?
• Orthogonal Latin squares based on groups
• A random construction for permutation codes and the covering radius
• Reduction of the Hall-Paige conjecture to sporadic simple groups.
• The chromatic number of finite group Cayley tables
• Covering radius for sets of permutations
• Covering radius in the Hamming permutation space
• Rainbow matchings in \(r\)-partite \(r\)-graphs
• The admissibility of sporadic simple groups.
• Sequenceable groups and related topics.
• On the chromatic number of Latin square graphs
• Harmonious groups
• Sequencing certain dihedral groups
• Degree Conditions for Matchability in 3‐Partite Hypergraphs
• A note on finite abelian groups
• A Combinatorial Problem on Abelian Groups
• Some Results in the Theory of Quasigroups
• Complete mappings of finite groups
• A lower bound for the length of a partial transversal in a Latin square

This page was built for publication: All group‐based latin squares possess near transversals