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, March 28, 2017, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Matija Bucic

Directed Ramsey number for trees

Given an oriented graph H, the k-colour oriented Ramsey number of H, denoted by R(H,k), is the least integer n, for which every k-edge-coloured tournament on n vertices contains a monochromatic copy of H. We show that R(T,k) < ck|T|k for any oriented tree T, which, in general, is tight up to a constant factor. We also obtain a stronger bound, when H is an arbitrarily oriented path. This is joint work with Shoham Letzter and Benny Sudakov.

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