Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, December 06, 2012, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Henning Thomas
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.
Automatic MiSe System Software Version 1.4803M | admin login