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, January 26, 2016, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Pascal Su

Bipartite Kneser graphs are Hamiltonian

For integers $k\ge1$ and $n\ge2k+1$ the bipartite Kneser graph is the graph with vertex set the $k$ and $n-k$ element subsets of $\{ 1,...,n \}$ and edges between two sets where the first is a subset of the other. It has been conjectured that this graph is Hamiltonian. Based on a recent result that proves that the middle levels graph (n=2k+1) is Hamiltonian we have shown that in fact all bipartite Kneser graphs are Hamiltonian.


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