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: Thursday, October 29, 2015, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Alexey Pokrovskiy

Covering coloured graphs by cycles

A conjecture of Erdős, Gyárfás, and Pyber says that the vertices of any r-edge-coloured complete graph can be covered by r vertex-disjoint monochromatic cycles. This conjecture was proved for r = 2, but turned out to be false for r at least 3. However there remain various weaker versions of the conjecture which may still hold. I will discuss how to prove a 3-colour version of it when one wants to cover the graph by paths instead of cycles.

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

Previous talks by year:   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