Abstract

Abstract Given a coloring of the edges of a multi-hypergraph, a rainbow t-matching is a collection of t disjoint edges, each having a different color. In this note we study the problem of finding a rainbow t-matching in an r-partite r-uniform multi-hypergraph whose edges are colored with f colors such that every color class is a matching of size t. This problem was posed by Aharoni and Berger † The second author was supported in part by SNSF grant 200021-149111 and by a USA-Israel BSF grant. ‡ The third author was partially supported by DFG within the research training group Methods for Discrete Structures. 1 superexponential estimate of Alon