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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q510490
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2004.02.027 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: P. G. Boyvalenkov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2004.02.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080585644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals in row-latin rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lopsided Lovász Local lemma and Latin transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem on Abelian Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the length of a partial transversal in a Latin square / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals of latin squares and their generalizations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2004.02.027 / rank
 
Normal rank

Latest revision as of 05:41, 10 December 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