Transversals in long rectangular arrays

DOI10.1016/J.DISC.2004.02.027MaRDI QIDQ856842zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 14 December 2006

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2004.02.027

zbMATH Keywords

Latin squarestransversal

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Transversal (matching) theory (05D15)

Review text

A transversal in an \(m\times n\) array, \(m \leq n\), is a set of \(m\) cells such that no two cells are in the same row or column and no two cells contain the same symbol. The authors prove that if \(n \geq 2m^3\) and in an \(m \times n\) array every symbol appears at most \(\frac{mn-1}{m-1}\) times then there exists a transversal in this array.

Recommendations

• Transversals in \(m \times n\) arrays
• Transversals in rectangular arrays
• Transversals in Latin arrays with many distinct symbols
• The number of distinct symbols in sections of rectangular arrays
• Transversals in rectangles

Cites work

• A Combinatorial Problem on Abelian Groups
• A lower bound for the length of a partial transversal in a Latin square
• scientific article; zbMATH DE number 16256 (Why is no real title available?)
• Lopsided Lovász Local lemma and Latin transversals
• Transversals in row-latin rectangles
• Transversals of latin squares and their generalizations

Cited in

(7)

• Transversals in \(m \times n\) arrays
• Transversals in rectangles
• Transversals in rectangular arrays
• Transversals of rectangular arrays
• Transversals in Latin arrays with many distinct symbols
• On the number of symbols that forces a transversal
• The number of distinct symbols in sections of rectangular arrays

This page was built for publication: Transversals in long rectangular arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856842)