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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Thursday, March 16, 2017, 12:15 pm

**Duration**: 30 minutes

**Location**: CAB G51

**Speaker**: Shoham Letzter (ITS)

Given a tournament on n vertices, it is not hard to see that there is a 2-colouring of the edges such that the longest directed path has length O(n/sqrt(log n)). We show that for almost all tournaments, this bound is tight. I.e., for almost all tournaments, given any 2-colouring, there is a monochromatic directed path of length at least Omega(n/sqrt(log n)). This is joint work with Matija Bucić and Benny Sudakov.

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

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