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, October 13, 2011, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Frank Mousset

Rainbow Paths in Proper Edge Colorings of Complete Graphs

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.

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