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, July 25, 2006, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Yoshiharu Kohayakawa (Univ. de São Paulo)

The size-Ramsey number of short subdivisions

We shall discuss Ramsey properties of the random graph $G(n,p)$ with respect to bounded subdivisions of bounded degree graphs with nearly $\Omega(n)$ vertices. As a consequence, we shall prove an upper bound for the size-Ramsey number of such subdivisions. This result complements previous results due to Pak and due to Donadelli, Haxell, and the speaker.

Joint work with V. Rödl and E. Tengan (Emory University).

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