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

Speaker: Alp Muyesser (UCL)

Thursday 25th April, 3:00 in Fine Hall 224.

Title: Approximate path decompositions of regular graphs

We show that any d-regular graph can be almost decomposed 
into paths of length roughly d, giving an approximate solution 
to a problem of Kotzig from 1957. Along the way, we show that 
almost all vertices of a d-regular graph can be partitioned 
into n/(d+1) paths, asymptotically confirming a conjecture 
of Magnant and Martin from 2009.

This is joint work with Richard Montgomery, Alexey Pokrovskiy, 
and Benny Sudakov.

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

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