Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, October 27, 2005, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Jozef Skokan (Univ. of Illinois at Urbana-Champaign and Univ. de São Paulo)
For two graphs G and H we denote by ex(G,H) the maximum number of edges in a subgraph of G that does not contain H. When G is the complete graph on n vertices we obtain the Turán number ex(n,H) whose value is asymptotically given by Erdős - Stone - Simonovits theorem. In this talk we will review results and present some new ones for the case when G is not the complete graph.
Automatic MiSe System Software Version 1.4803M | admin login