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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Thursday, April 17, 2014, 12:15 pm

**Duration**: 30 minutes

**Location**: CAB G51

**Speaker**: Torsten Mütze

Define the middle layer graph as the graph whose vertex set consists of all bitstrings of length 2n+1 that have exactly n or n+1 entries equal to 1, with an edge between any two vertices for which the corresponding bitstrings differ in exactly one bit. The middle levels conjecture asserts that this graph contains a Hamilton cycle for every n>=1. This conjecture originated probably with Havel, Buck and Wiedemann, but has also been attributed to Dejter, Erdős, Trotter and various others, and despite considerable efforts it remained open during the last 30 years. One of the motivations for tackling this conjecture is an even more general conjecture due to Lovász, which asserts that every connected vertex-transitive graph (as e.g. the middle layer graph) contains a Hamilton path, and apart from five exceptional graphs, even a Hamilton cycle.

In this talk I present a proof of the middle levels conjecture. In fact, I show that the middle layer graph contains 2^{2^{\Omega(n)}} different Hamilton cycles, which is best possible.

http://www.openproblemgarden.org/op/middle_levels_problem

http://www.math.uiuc.edu/~west/openp/revolving.html

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