SoSe 17: Diskrete Mathematik I
Jean-Philippe Labbé
Additional information / Pre-requisites
Target group:
BMS students, Master and Bachelor students
Comments
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)
Suggested reading
Literature:
- M. Aigner: Diskrete Mathematik
- R. Diestel: Graph Theory
- J. Matousek, J. Nesetril: An invitation to Discrete Mathematics
- D. West: Introduction to Graph Theory
28 Class schedule
Additional appointments
Wed, 2017-07-26 14:00 - 17:00
Location:
T9/Gr. Hörsaal (Takustr. 9)
Location:
T9/Gr. Hörsaal (Takustr. 9)
Regular appointments
Location:
T9/SR 006 Seminarraum (Takustr. 9)
Location:
T9/SR 006 Seminarraum (Takustr. 9)
Location:
T9/SR 006 Seminarraum (Takustr. 9)
Location:
T9/SR 006 Seminarraum (Takustr. 9)
Location:
T9/SR 006 Seminarraum (Takustr. 9)
Location:
T9/SR 006 Seminarraum (Takustr. 9)
Location:
T9/SR 006 Seminarraum (Takustr. 9)
Location:
T9/SR 006 Seminarraum (Takustr. 9)
Location:
T9/SR 006 Seminarraum (Takustr. 9)
Location:
T9/SR 006 Seminarraum (Takustr. 9)
Location:
T9/SR 006 Seminarraum (Takustr. 9)
Location:
T9/SR 006 Seminarraum (Takustr. 9)
Location:
T9/SR 006 Seminarraum (Takustr. 9)
Location:
T9/SR 006 Seminarraum (Takustr. 9)
Content:
Selection from the following topics: Counting (basics, double counting, Pigeonhole Principle, recursions, generating functions, Inclusion-Exclusion, inversion, Polya ... read more