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, October 13, 2016, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Joel Spencer (New York University)

The Long Journey of R(3,k)

Ramsey Theory is a fascinating topic. Here we speak of a specific problem, the Ramsey function R(3,k). The story begins with George Szekeres, Esther Klein and a young Paul Erdos walking the beautiful hills of Budapest. Results were given in 1932-3, 1946, 1968, 1980, 1995 until the asymptotic resolution (also 1995) by Jeong Han Kim that R(3,k) is within a constant of k^2/(\ln k). The story, however, didn't end. In 2009 Tom Bohman gave a new proof, analyzing the random triangle-free process. Deeper analysis, by several researchers, has recently lowered the gap between the implied constants to four. We shall outline many of the arguments which, in their own way, provide a history of the development of Ramsey Theory and the Probabilistic Method.

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