Instructor: Rado Fulek and Uli Wagner

Teaching Assistant: Sergey Avvakumov

Date | Topic | Location | Other |
---|

Starting with LovĂˇsz' solution of Kneser's conjecture in 1978, a number of problems in discrete mathematics and theoretical computer science have been solved using methods from algebraic and geometric topology. The aim of this course is to explain some of these results and methods to a broad audience; the precise choice of topics will depend on the audience's background.

Sample topics incude:

- Topological lower bounds for the chromatic number of a graph
- Matchings in hypergraphs
- Decision tress complexity and evasiveness of graph properties
- (Non)embeddability and Tverberg-type results
- Impossibility theorems in distributed computing

Weekly homework and final exam

3 ETCS

File | Due Date |
---|---|

Homework 1 | October 18, 2016 |

Homework 2 | October 25, 2016 |

Homework 3 | November 8, 2016 |

Homework 4 | November 22, 2016 |