Title: Nonembeddability and Tverberg-type Theorems in Combinatorics

Date: 11/29/2016

Time: 4:10 PM - 5:00 PM

Place: C304 Wells Hall

It is well-known that there are exactly two 'minimal' non-planar graphs, that is, graphs which cannot be embedded in the plane. It should then come as no surprise that one would like to generalize this combinatorial result to the case of embeddability of simplicial complexes. Topological methods have proven to be very useful here, with one of the landmark theorems being the topological Tverberg theorem of 1966. In this sequence of talks, we survey nonembeddabililty results, a surprising recent development of the topological Tverberg conjecture, and notions related to these topics.