Orthogonal matchings

DOI10.1016/S0012-365X(97)00025-3MaRDI QIDQ5906853zbMATH OpenOpenAlexFDO

Authors R. P. Anstee, Louis Caccetta

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

perfect matchingstransversalLatin squareproblem 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)

Recommendations

• Orthogonal matchings revisited
• On the problem of a matching orthogonal to a 2-factorization
• On the existence of a matching orthogonal to a 2-factorization
• Orthogonal matchings
• On solutions of Alspach's problems

Cites work

• scientific article; zbMATH DE number 91016 (Why is no real title available?)
• scientific article; zbMATH DE number 3613053 (Why is no real title available?)
• A lower bound for the length of a partial transversal in a Latin square
• 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

Cited in

(8)

• Orthogonal matchings revisited
• On the existence of a matching orthogonal to a 2-factorization
• Orthogonal factorizations of digraphs
• Orthogonal pairs
• A note on rainbow matchings
• Orthogonal decomposition and packing of complete graphs
• Symmetry-preserving matchings
• Some problems on factorizations with constraints in bipartite graphs

This page was built for publication: Orthogonal matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5906853)