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, April 15, 2010, 12:15 pm

**Duration**: This information is not available in the database

**Location**: CAB G51

**Speaker**: Ido Ben-Eliezer (Tel Aviv University)

We study the size Ramsey number of directed path of length n in oriented graphs, where no antiparallel edges are allowed. We give nearly tight bounds for every fixed number of colors, showing that for every q\geq 1 there are constant c,c_q such that \frac{c_q n^{2q}\log^{1/q} n}{\log^{(q+2)/q}\log n} \leq r_e(\overrightarrow{P_n},q+1) \leq c n^{2q}\log^{2}{n}. In particular this shows that the size Ramsey number in oriented graphs is asymptotically larger than the size Ramsey number in general directed graphs.

Joint work with Michael Krivelevich and Benny Sudakov.

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