Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, December 14, 2017, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Shoham Letzter
Magnant and Martin conjectured that every k-regular graph on n vertices can be partitioned into at most n / (k + 1) paths, a bound which is attained by a disjoint union of (k + 1)-cliques. We prove this conjecture in the case where k is linear in n and n is large. This talk is based on joint work with Vytautas Gruslys.
Automatic MiSe System Software Version 1.4803M | admin login