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, November 24, 2009, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Andrea Francke

A simple proof of the upper bound theorem (student talk, 45 min.)

The Upper Bound Theorem, first proved by McMullen in the 1970's, is one of the most fundamental theorems about convex polytopes. The theorem gives exact upper bounds for the maximum number of faces of a d-dimensional convex polytope with n vertices. In this article, a new, simple proof is given that reduces the theorem to a purely combinatorial problem about systems of sets with certain intersection properties, and then uses methods from (multi)linear algebra to solve the latter. This paper is one of the clearest and most elegant applications of linear algebra methods in combinatorics.

Paper by Noga Alon and Gil Kalai: A simple proof of the upper bound theorem, European Journal of Combinatorics 6 (1985), 211-214.

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