Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, March 01, 2018, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Alexey Pokrovskiy

Rainbow trees and their applications

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.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login