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: Thursday, February 21, 2008, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Uli Wagner

Van Kampen's Obstruction and Embeddability of Skeleta of Spheres

Consider the following statement: If G is a planar simple graph all of whose faces are triangles, then G is maximally planar, i.e., adding a single edge to G makes G nonplanar.

For graphs, this is an immediate consequence of Euler's formula. I will present a different proof based on the so-called van Kampen obstruction. This proof has the disadvantage that it is more complicated than mere counting, but on the other hand, it also works in much more generality to prove the following statement, which generalizes a theorem of van Kampen:

If S is the d-skeleton of a 2d-dimensional piecewise linear sphere then adding a missing d-face to S makes S nonembeddable in R^{2d}.

I will try to explain all the relevant notions in the course of the talk, which means that most likely, there will not be much time to explain the motivation, i.e., how the more general statement is related to a conjecture by Kalai and Sarkaria and the so-called g-Conjecture for simplicial spheres, but one can always be optimistic.

Joint work with Eran Nevo (Cornell).

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