On a Generalization of the Ryser-Brualdi-Stein Conjecture
Abstract
A rainbow matching for (not necessarily distinct) sets F1,...,Fk of hypergraph edges is a matching consisting of k edges, one from each Fi. 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.