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 A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, May 10, 2011, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Torsten Mütze

Explicit matchings in the middle levels graph

Define the 'middle levels graph' M_{2n+1} of the discrete cube Q_{2n+1} as the bipartite graph whose vertices are all bitstrings of length (2n+1) with exactly n or exactly n+1 entries equal to 1, where two vertices are connected whenever the corresponding bitstrings differ in exactly one bit. By Hall's theorem the graph M_{2n+1} clearly has a perfect matching, but it is surprisingly difficult to find `explicit' constructions of such matchings. In this talk I will present and compare several constructions known from the literature, and also motivate why we are interested in such matchings.

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