Rainbow Matchings and Rainbow Connectedness

[摘要] Aharoni and Berger conjectured that every collection of $n$ matchings of size $n+1$ in a bipartite graph contains a rainbow matching of size $n$. This conjecture is related to several old conjectures of Ryser, Brualdi, and Stein about transversals in Lati

[学科分类] 离散数学和组合数学

[关键词] Matchings;Connectedness;Latin Squares;Transversals