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, November 01, 2018, 12:15 pm

**Duration**: 30 minutes

**Location**: OAT S15/S16/S17

**Speaker**: Jerri Nummenpalo

For a positive integer k, the middle levels graph M_k is the bipartite graph that appears between the two middle levels of a Boolean hypercube of dimension 2k+1. In other words, the vertices of M_k are all bitstrings of length 2k+1 with either k or k+1 bits equal to 1, and two vertices are adjacent if they differ in exactly one bit. A conjecture, that became known as the middle levels conjecture, asserts that M_k is Hamiltonian, i.e., that there is a cycle that covers the whole graph. The conjecture seems to have first appeared in the 1980s in papers by Havel and by Buck and Wiedemann, though some unclarity of its origin remains, and it has also been attributed to Erdős, Trotter and Dejter.

The middle levels conjecture was resolved recently on the positive by Mütze. His proof is a technical, 37-page paper and our result is a much shorter, simpler and more accessible proof. In this talk I will go through the main ideas of our proof and show a connection between the lexical matchings in M_k, plane trees and Catalan numbers.

Based on joint work with Petr Gregor and Torsten Mütze.

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

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