Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, December 09, 2004, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Péter Csorba
Matousek and Ziegler compared various topological lower bounds for the chromatic number. They proved that Lovasz's original bound can be restated as \chr(G) >= ind(B(G)) +2. Sarkaria's bound can be formulated as \chr(G) >= ind(B0(G)) +1. It is known that these lower bounds are close to each other, namely the difference between them is at most 1. In this talk we will take a closer look to these lower bounds.
Automatic MiSe System Software Version 1.4803M | admin login