Transversals in long rectangular arrays (Q856842): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q510490
RedirectionBot (talk | contribs)
Changed an Item
Property / reviewed by
 
Property / reviewed by: P. G. Boyvalenkov / rank
 
Normal rank

Revision as of 18:59, 15 February 2024

scientific article
Language Label Description Also known as
English
Transversals in long rectangular arrays
scientific article

    Statements

    Transversals in long rectangular arrays (English)
    0 references
    0 references
    14 December 2006
    0 references
    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.
    0 references
    Latin squares
    0 references
    transversal
    0 references

    Identifiers