Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Theory of Combinatorial Algorithms
Prof. Emo Welzl and Prof. Bernd Gärtner
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, October 26, 2004, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Sonja Čukić (KTH Stockholm)
For any two graphs G and H, Lovász defined a cell complex Hom with an idea that topological and algebraic invariants of these complexes should provide non-trivial lower bounds for chromatic numbers of graphs.
In this talk, I will present some recent results about topological properties of certain classes of Hom complexes.
(Joint work with D. Feichtner-Kozlov)
Upcoming talks | All previous talks | Talks by speaker | 
Upcoming talks in iCal format (beta version!)
Previous talks by year: 2024 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
