***********************************
                * Princeton Discrete Math Seminar *
                ***********************************

Date: Thursday 28th September, 3:00 in Fine Hall 224.
 
Speaker: Ron Aharoni (Technion, Haifa)

Title: Rainbow matchings. 

Given a family F_1,...,F_m of sets of edges in a graph or
hypergraph, a ``rainbow matching'' is a choice of disjoint edges 
e_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.


Next week: TBA

Anyone wishing to be added to or removed from this mailing list should
contact Paul Seymour (pds@math.princeton.edu)