# Rainbow matchings.

Thursday, September 28, 2017 -
3:00pm to 4:30pm
Given a family F_1,...,F_m of sets of edges in a graph or hypergraph, a rainbow matching'' is a choice of disjoint edgese_1 in F_1,..., e_m in F_m.  The talk is on open problems regarding this notion, some old and some new results, and what topology has to contribute to the subject.
Speaker:
Ron Aharoni
Haifa University
Event Location:
Fine Hall 224