On a Generalization of the Ryser-Brualdi-Stein Conjecture

Authors


  • Contract grant sponsor: ISF; Contract grant number: 2017006; Contract grant sponsor: BSF; Contract grant number: 2006099, Contract grant sponsor: ARC; Contract grant number: DP120100197; Contract grant sponsor: Discount Bank chair.

Abstract

A rainbow matching for (not necessarily distinct) sets math formula of hypergraph edges is a matching consisting of k edges, one from each math formula. 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.

Ancillary