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, June 27, 2017, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: József Balogh (University of Illinois)

An improved lower bound for Folkman's theorem

Folkman's Theorem asserts that for each k in N, there exists a natural number n=F(k) such that whenever the elements of [n] are two-coloured, there exists a subset A of [n] of size k with the property that all the sums of the form \sum_{x\in B} x, where B is a nonempty subset of A, are contained in [n] and have the same colour. In 1989, Erd\H{o}s and Spencer showed that F(k) >= 2^{ck^2/log k}, where c>0 is an absolute constant; here, we improve this bound significantly by showing that F(k)>= 2^{2^{k-1}/k} for all k in N. Joint with Sean Eberhard, Bhargav Narayanan, Andrew Treglown, Adam Zsolt Wagner.

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