An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols
From MaRDI portal
Publication:1242922
DOI10.1016/0097-3165(78)90009-2zbMath0368.05012OpenAlexW2044640284MaRDI QIDQ1242922
Publication date: 1978
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(78)90009-2
Related Items
The number of distinct symbols in sections of rectangular arrays ⋮ An improved bound on the sizes of matchings guaranteeing a rainbow matching ⋮ Large matchings in bipartite graphs have a rainbow matching ⋮ An approximate version of a conjecture of Aharoni and Berger ⋮ New bounds for Ryser’s conjecture and related problems ⋮ On a Generalization of the Ryser-Brualdi-Stein Conjecture ⋮ Topological methods for the existence of a rainbow matching ⋮ Almost all optimally coloured complete graphs contain a rainbow Hamilton path ⋮ Computing Autotopism Groups of Partial Latin Rectangles ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Integrality gaps for colorful matchings ⋮ On a conjecture of Stein ⋮ Longest partial transversals in plexes ⋮ Hamilton transversals in random Latin squares ⋮ Fair representation in dimatroids ⋮ Choice functions ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Degree Conditions for Matchability in 3‐Partite Hypergraphs ⋮ Orthogonal Latin Rectangles ⋮ Embedding rainbow trees with applications to graph labelling and decomposition ⋮ On the plane term rank of three dimensional matrices ⋮ Rainbow matchings and cycle-free partial transversals of Latin squares ⋮ Rainbow matchings and rainbow connectedness ⋮ On rainbow matchings in bipartite graphs ⋮ Rainbow perfect matchings in \(r\)-partite graph structures ⋮ A lower bound for the length of a partial transversal in a Latin square ⋮ Rainbow matchings in bipartite multigraphs ⋮ A lower bound for the length of a partial transversal in a Latin square ⋮ Orthogonal matchings ⋮ A matroid generalization of a result on row-Latin rectangles ⋮ Rainbow paths and large rainbow matchings ⋮ Transversals in \(m \times n\) arrays ⋮ Combinatorial analysis. (Matrix problems, choice theory) ⋮ Rainbow sets in the intersection of two matroids
Cites Work
