Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, October 13, 2011, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Frank Mousset
In a properly edge coloured graph, a subgraph using every colour at most once is called `rainbow'. This talk is specifically about rainbow paths in complete graphs, which were the primary subject of my bachelor thesis entitled `Rainbow Cycles and Paths'. I will talk about some problems related to such paths, and, time permitting, outline a proof that in every proper edge colouring of K_n, there are rainbow paths on (3/4-o(1))n vertices.
Automatic MiSe System Software Version 1.4803M | admin login