On a Generalization of the Ryser-Brualdi-Stein Conjecture
Aharoni, Ron · Charbit, Pierre · Howard, David
Original · EN
A rainbow matching for (not necessarily distinct) sets F₁,...,Fₖ of hypergraph edges is a matching consisting of k edges, one from each Fᵢ. The aim of the paper is twofold - to put order in the multitude of conjectures that relate to this concept (some of them first presented here), and to present some partial results on one of these conjectures, that seems central among them.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.