| 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 On box complexesMatousek 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.
Upcoming talks | All previous talks | Talks by speaker |  Upcoming talks in iCal format (beta version!) Previous talks by year: 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.3392 | admin login
|
