Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, March 01, 2007, 12:15 pm
Duration: This information is not available in the database
Location: CAB G51
Speaker: Anusch Taraz (TU München)
In this talk we discuss the proof of the following conjecture by Bollobás and Komlós: Suppose that G and H are both graphs on n vertices, H has bounded maximum degree, chromatic number r, and bandwidth o(n), G has minimum degree at least ((r-1)/r + eps)n, and n is sufficiently large. Then G must contain a copy of H.
Joint work with Julia Böttcher and Mathias Schacht.
Automatic MiSe System Software Version 1.4803M | admin login