Premium
On a Generalization of the Ryser‐Brualdi‐Stein Conjecture
Author(s) -
Aharoni Ron,
Charbit Pierre,
Howard David
Publication year - 2015
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.21796
Subject(s) - generalization , conjecture , matching (statistics) , rainbow , combinatorics , order (exchange) , multitude , mathematics , discrete mathematics , epistemology , physics , philosophy , statistics , mathematical analysis , economics , finance , quantum mechanics
A rainbow matching for (not necessarily distinct) setsF 1 , … , F kof hypergraph edges is a matching consisting of k edges, one from each F i . 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.