Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Friday, May 28, 2004, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Carsten Lange (TU Berlin)
In 1978 Lovasz presented a powerful (topological) technique to prove lower bounds for the chromatic number of graphs. As a corollary, he proved Kneser's conjecture that asked for the chromatic number of Kneser graphs. A Kneser graph has the k-subsets of an n-set as vertices and two vertices form an edge if they are disjoint. A first example is the Petersen graph.
The topological lower bound can be phrased for Kneser graphs in combinatorial terms by the colourability defect introduced by Dolnikov in 1981.
In this talk, we survey known lower bounds for several r-uniform hypergraphs of Kneser type in terms of a generalised colourability defect and point to different trapdoors that are hidden on the way.
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