Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Tuesday, December 16, 2003, 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
In the topological approach to graph coloring problems, initiated by Lov\'asz, lower bounds on the chromatic number $\chi (G)$ of a graph $G$ are obtained by associating certain simplicial or cell complexes to $G$ and then exploiting topological invariants of the resulting spaces.
Recently, Babson and Kozlov proved Lov\'asz' conjecture that if for a graph $G$ the cell complex $Hom(C_{2r+1},G)$, introduced by Lov\'asz, is $k$-connected for some $r\geq 1$, then $\chi (G)\geq k+4$.
In this talk, we will see why is it difficult and that, in fact, $Hom(C_{5},K_{n+2})$ is an $({n-1})$-sphere bundle over the $n$-sphere.
(Joint work with Frank Lutz)
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 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.4803M | admin login