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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, December 06, 2012, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Henning Thomas

Dependent Random Choice

Many problems in Ramsey Theory and Extremal Graph Theory deal with embedding a small or sparse graph in a dense graph. In this talk we present a simple and yet surprisingly powerful probabilistic technique, called "Dependent Random Choice", which has recently had several striking applications. As a simple application we will discuss a tight upper bound on the Turán number of bipartite graph and sketch further applications if time permits.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   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