Transversals in long rectangular arrays
type: Item
instance of: scholarly article
title: Transversals in long rectangular arrays
zbMATH Open document ID: 1124.05016
author: N. E. Zubov
published in: Discrete Mathematics
publication date: 2006-12-14T00:00:00Z
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.
Mathematics Subject Classification ID: 05B15
Mathematics Subject Classification ID: 05D15
zbMATH DE Number: 5080044
zbMATH Keywords: Latin squares
zbMATH Keywords: transversal
reviewed by: Peter Boyvalenkov
MaRDI profile type: Publication
full work available at URL: j.disc.2004.02.027
OpenAlex ID: W2080585644
cites work: Q3972909
cites work: Transversals in row-latin rectangles
cites work: Lopsided Lovász Local lemma and Latin transversals
cites work: A Combinatorial Problem on Abelian Groups
cites work: A lower bound for the length of a partial transversal in a Latin square
cites work: Transversals of latin squares and their generalizations
DOI: 10.1016/J.DISC.2004.02.027
description: scientific article; zbMATH DE number 5080044