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

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Benny Sudakov (UCLA - Departement of Mathematics)

A Conjecture of Erdos on Graph Ramsey Numbers

The Ramsey number r(G) of a graph G is the minimum N such that every red-blue coloring of the edges of the complete graph on N vertices contains a monochromatic copy of G. Determining or estimating these numbers is one of the central problems in combinatorics. One of the oldest results in Ramsey Theory, proved by Erdos-Szekeres in 1930's, asserts that the Ramsey number of the complete graph with m edges is at most 2^{O(\sqrt{m})}. Motivated by this about quarter century ago Erdos conjectured that there is an absolute constant c such that r(G) \leq 2^{c\sqrt{m}} for any graph G with m edges. In this talk we discuss proof of this conjecture.

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