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: Thursday, March 24, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Elias Vicari

Off-Diagonal Ramsey Numbers

In this talk we will present a deterministic proof of Spencer's lower bound for the off-diagonal Ramsey numbers. The basic tool will be the Erdős-Selfridge theorem (biased version), a well-known result from the field of positional games. We will interpret the Ramsey problem as a positional game, where two players alternately color edges of a complete graph Km. The goal of both is to color monochromatically the edge set of a copy of a target complete graph Ks and Kn, respectively (for s fix and n growing). If the board size m=m(n) is not too big, we will be able to provide both players a deterministic drawing strategy, which would imply that R(s,n)>m.

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