Orthogonal matchings

DOI10.1016/S0012-365X(97)00025-3zbMath0893.05014OpenAlexW2912516627MaRDI QIDQ5906853

Louis Caccetta, Richard P. Anstee

Publication date: 20 July 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00025-3

zbMATH Keywords

Latin squaretransversalperfect matchingsproblem of Alspachorthogonal 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)

Related Items (5)

Orthogonal decomposition and packing of complete graphs ⋮ Some problems on factorizations with constraints in bipartite graphs ⋮ Orthogonal factorizations of digraphs ⋮ A NOTE ON RAINBOW MATCHINGS ⋮ Orthogonal matchings revisited

Cites Work

• An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols
• On the existence of a matching orthogonal to a 2-factorization
• A lower bound for the length of a partial transversal in a Latin square
• Unnamed Item
• Unnamed Item

This page was built for publication: Orthogonal matchings