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: Tuesday, May 22, 2018, 12:15 pm

Duration: 45 minutes

Location: CAB G51

Speaker: Daan Nilis

An inductive construction for Hamilton cycles in Kneser graphs

The Kneser graph K(n, r) has as vertices all r-subsets of an n-set with two vertices adjacent if the corresponding subsets are disjoint. It is conjectured that all connected Kneser graphs, except K(5, 2), are Hamiltonian. In this talk the focus will be on understanding the construction that Johnson uses to relate Hamiltonicity of K(2r+2s, r) to Hamiltonicity of K(2a+s, a) for a < = r/2.


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