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 A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, April 09, 2019, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Richard Montgomery (University of Birmingham )

Rainbow Spanning Tree Decompositions

Consider a proper edge colouring of a complete graph, so that no two touching edges share a colour. It is easy to find a tree containing every vertex whose edges are all different colours (that is, a rainbow spanning tree). Indeed, we can simply take all the edges around any one vertex. Finding many edge-disjoint rainbow spanning trees is a much more difficult task. This talk will address this question, including a solution for a natural large class of edge colourings. This is joint work with Stefan Glock, Daniela Kühn and Deryk Osthus

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

Previous talks by year:   2024  2023  2022  2021  2020  2019  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