This semester's topic:
Topological methods in graph theory
Instructor: Dr. László Lovász
How to use some fundamental results in topology to prove theorems in graph theory, which don't have anything to do with topology (at least on the surface)? We introduce some basic notions in combinatorial topology, and then apply theorems like Brower's and Borsuk's to prove results about graph partitioning, chromatic number, connectivity, and certain algorithms.
This course is intended for Master's students. The language of instruction is English.