Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, March 01, 2018, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Alexey Pokrovskiy
A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. The study of rainbow subgraphs goes back to the work of Euler on Latin squares. In this talk we will show that every properly coloured complete graph has a rainbow copy of every nearly spanning tree. We will also discuss applications of this result to several problems in graph theory. In particular we show that conjectures of Andersen, Ringel, and Graham-Sloane hold asymptotically. This is joint work with Richard Montgomery and Benny Sudakov.
Automatic MiSe System Software Version 1.4803M | admin login