Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, May 22, 2014, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Lothar Narins (FU Berlin)

The Connectedness of the Independence Complex of Line Graphs

I will discuss the application of the topological connectedness of the independence complex of line graphs to Ryser's Conjecture, which is a generalization of König's Theorem to hypergraphs. This technology has resulted in a proof of the conjecture for 3-uniform hypergraphs as well as a characterization of the 3-uniform extremal examples.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   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