Covers and partial transversals of Latin squares (Q2414936): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q129622343, #quickstatements; #temporary_batch_1724739681498
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Transversals and multicolored matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thank Evans! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact bounds on the sizes of covering codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On transversals in Latin squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Latin squares with no transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-domination and \(k\)-independence in graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Latin squares. New developments in the theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Latin Squares with Restricted Transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Incomplete Latin Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Latin rectangle graphs and autoparatopism groups of partial Latin rectangles with trivial autotopism 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: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intercalates and discrepancy in random Latin squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of transversals in a Latin square / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of the chromatic index for hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Theorem with an Application to Latin Rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3924220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3089374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of Latin squares without orthogonal mates / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129622343 / rank
 
Normal rank

Latest revision as of 07:35, 27 August 2024

scientific article
Language Label Description Also known as
English
Covers and partial transversals of Latin squares
scientific article

    Statements

    Covers and partial transversals of Latin squares (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 May 2019
    0 references
    In order to delve into the study of transversals of Latin squares, both concepts of $c$-cover and partial transversal of deficit $d$ of a Latin square of order $n$ are introduced. The former (respectively, the latter) refers to a set of $c$ entries (respectively, $n-d$ entries) of the Latin square, with at least (respectively, at most) one entry per row, one entry per column and one entry per symbol. A cover is said to be minimal if it does not contain any proper subset being also a cover of the Latin square. On the other hand, a partial transversal is said to be maximal if it is not contained in a larger partial transversal. The paper deals with the relationship among all these concepts. Thus, for instance, it is proved that every $(n + a)$-cover contains a partial transversal of deficit $2a$. If $n\geq 2$, then every partial transversal of deficit $d$ is contained in an $(n + \lceil d/2 \rceil)$-cover. If the former is maximal, then the smallest cover containing it has size $n + \lceil d/2 \rceil$. As a consequence, the minimum size of a cover in a Latin square of order $n\geq 2$ is $n + a$ if and only if the minimum deficit of a partial transversal of such a Latin square is either $2a$ or $2a - 1$. If $n\geq 5$, then each entry of a Latin square having a transversal belongs to a minimal $(n + 1)$-cover. The authors also prove that every minimal cover of a Latin square of order $n$ has size at most $\lfloor 3(n + 1/2 - \sqrt{n + 1/4})\rfloor$. The existence of a Latin square of order $t^2 + t$ containing a minimal $c$-cover for all $c\in\{t^2 + t,\ldots, 3t^2\}$ is also ensured. Some asymptotical considerations and open problems are enumerated.
    0 references
    Latin square
    0 references
    transversal
    0 references
    covers
    0 references

    Identifiers