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, June 22, 2006, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Eran Nevo (Department of Mathematics, Hebrew University)

Combinatorial embedding obstructions for simplicial complexes

A famous result by Kuratowski asserts that a graph can be embedded into a $2$-sphere iff it contains neither of the graphs $K_5$ and $K_{3,3}$ as minors. We generalize the notion of graph minors to all (finite) simplicial complexes in a way that produces obstructions to embeddability of higher dimensional complexes in higher dimensional spheres. We make use Van Kampen's obstruction, which will be reviewed.

We answer affirmatively a problem asked by Dey et al. concerning topology-preserving edge contractions, and conclude from it the validity of the generalized lower bound inequalities for a special class of triangulated spheres.

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