On the number of symbols that forces a transversal

DOI10.1017/S0963548319000282zbMath1466.05217arXiv1805.10911OpenAlexW3101635160MaRDI QIDQ4993090

Peter Keevash, Liana Yepremyan

Publication date: 15 June 2021

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.10911

zbMATH Keywords

Latin squareLatin arrayrainbow perfect matching.

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15)

Related Items (5)

Full rainbow matchings in graphs and hypergraphs ⋮ New bounds for Ryser’s conjecture and related problems ⋮ Decompositions into isomorphic rainbow spanning trees ⋮ Parity of transversals of Latin squares ⋮ Positiveness of the permanent of 4-dimensional polystochastic matrices of order 4

Cites Work

• Unnamed Item
• Unnamed Item
• Transversals of latin squares and their generalizations
• Rainbow matchings and cycle-free partial transversals of Latin squares
• Transversals and multicolored matchings
• Transversals in Latin Arrays with Many Distinct Symbols
• Decompositions into spanning rainbow structures
• Rainbow structures in locally bounded colorings of graphs
• Transversals in generalized Latin squares
• A lower bound for the length of a partial transversal in a Latin square
• Holes in graphs

This page was built for publication: On the number of symbols that forces a transversal