Ron Aharoni (Haifa): Rainbow matchings

Given a family F_1, \ldots ,F_m of sets of edges in a graph or hypergraph, a {\em rainbow matching} is a choice of disjoint edges e_1 \in F_1, \ldots ,e_m \in F_m. The talk will tell of open problems on this notion, some old and new results, and what topology has to contribute to these results.