Content

Selection from the following topics:

• Counting (basics, double counting, Pigeonhole Principle, recursions, generating functions, Inclusion-Exclusion, inversion, Polya theory)
• Discrete Structures (graphs, set systems, designs, posets, matroids)
• Graph Theory (trees, matchings, connectivity, planarity, colorings)
• Algorithms (asymptotic running time, BFS, DFS, Dijkstra, Greedy, Kruskal, Hungarian, Ford-Fulkerson)

Literature

• M. Aigner: Diskrete Mathematik
• R. Diestel: Graph Theory
• J. Matousek, J. Nesetril: An invitation to Discrete Mathematics
• D. West: Introduction to Graph Theory

Exercises

The exercises are on Tuesday, 12-2 pm (SR 031/A6) and on Thursday 10-12 am (SR 031/A6).

Language

Lecture and exercises on Tuesday will be held in English, exercises on Thursday will be held in German. Solutions to the sheets can independently of the exercise group be submitted in English or German.

Target group

BMS students, Master and Bachelor students