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

Speaker: Eli Berger (U. Haifa)

TUESDAY 8th October, 3:00 in Fine Hall 314. (Please note the unusual date and place!)

Title: Coloring the intersection of two matroids

Coloring the intersection of a set of matroids on the same ground
set means assigning colors to the elements of the ground set, where each
color class is independent in all matroids. In 2006 Aharoni and I proved
that if one matroid is p colorable and the other is q colorable,  then their
intersection is p+q colorable, under the assumption that p devides q. In
this talk I show that this assumption is not needed. For this end I
introduce a new method for estimating the topological connectivity of the
intersection of matroids. This is joint work with He Guo. 

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

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