The Taub Faculty of Computer Science Events and Talks

The idea of using topology in order to solve combinatorial problems has been known for several decades, but only recently it started to become an organized theory. In my talk I will introduce several classical topological theorems such as Brouwer's fixed point theorem and Sperner's Lemma and give the basic methods for using them in combinatorial settings. I will also describe a new approach that may enable us to use the Borsuk Ulam theorem in similar settings and hopefully obtain better results.