On a Generalization of the Ryser‐Brualdi‐Stein Conjecture |
| |
| Authors: | Ron Aharoni Pierre Charbit David Howard |
| |
| Affiliation: | 1. DEPARTMENT OF MATHEMATICS TECHNION, HAIFA, ISRAEL;2. LIAFA, UNIVERSITé PARIS DIDEROT, PARIS;3. DEPARTMENT OF MATHEMATICS, COLGATE UNIVERSITY, HAMILTON, NY |
| |
| Abstract: | A rainbow matching for (not necessarily distinct) sets  of hypergraph edges is a matching consisting of k edges, one from each  . The aim of the article is twofold—to put order in the multitude of conjectures that relate to this concept (some first presented here), and to prove partial results on one of the central conjectures. |
| |
| Keywords: | rainbow matchings hypergraph matchings Ryser's conjecture |
|
|
