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

Speaker: Ron Aharoni (Technion, Haifa)

Thursday 14th February, 3:00 in Fine Hall 224.

Title: Rainbow independent sets and collapsibility


Conjecture: Any 2n matchings of size n in any graph have a rainbow
matching of size n. 

("Rainbow" means choosing at most one edge from each of the given
matchings). 

We prove a fractional version, using a topological tool called 
"d-collapsibility". I will also discuss  the more general problem, 
of finding rainbow independent sets for given independent sets 
in general graphs (the above problem being the case of independent 
sets in line graphs). 

Based on joint work with Ron Holzman, Zilin Jiang, Joseph Briggs and
Minki Kim. The visit of the speaker is supported by the 
H2020-MSCA-RISE project CoSP- GA No. 823748.


		----------------------------------

Next week: Michael Krivelevich

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