Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, February 11, 2003, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Michael Krivelevich (Tel Aviv University)
In this talk I will describe several recent results about the maximum possible number of edges in graphs with a given number of vertices that contain no copy of a given bipartite graph (the so called Turan numbers). The results are proven applying (some variations of) a simple yet amazingly powerful double counting-type argument, which has been used by several researchers, including Rodl, Kostochka, Gowers and Sudakov.
Joint work with Noga Alon and Benny Sudakov.
Automatic MiSe System Software Version 1.4803M | admin login