Research Instituts for Discrete Mathematics

Vorlesung "Kombinatorik, Graphen, Matroide" / "Combinatorics, Graphs, Matroids"

Winter 2025/26

Modules V3C2, F4C1 and BA-INF MM 14

Topics: Combinatorics of finite sets, elementary counting theory, graphs, trees, circles, connectivity, planarity, graph coloring, matroids, planar and combinatorial duality

Recommended books:

• M. Aigner: Diskrete Mathematik. Vieweg, 6. Auflage 2006 (english version: M. Aigner: Discrete Mathematics. AMS, 2007)
• R. Diestel: Graphentheorie. Springer, 2. Auflage 2000, insbesondere Kapitel 1, 3 und 4 (english version: R. Diestel: Graph Theory. Springer, fourth edition 2010; in particular chapters 1, 3, and 4)
• B. Korte, J. Vygen: Combinatorial Optimization: Theory and Algorithms. Springer, Sixth Edition 2018 (in particular chapters 2 and 13).
• J. Oxley: Matroid Theory. Oxford University Press 1992

Exercises

• There are 2-hour exercise classes.
• Each Thursday, new exercise sheets are handed out, which have to be worked on within a week. Up to three students can hand in their solutions together.
• The exercise classes start on Monday, October 20.
• The solutions are submitted via the eCampus site.

Assignment sheets:

Admission to the exam:

• You need at least 50 percent of the total number of points.
• You have to present your solutions twice in the exercise classes.
• In groups of three, each participant has to be able to explain all solutions.

Exercise classes:

• Group A: Di, 10-12 (Seminarraum)
• Group B: Mi, 12-14 (Gerhard-Konow-Hörsaal)
• Group C: Do, 14-16 (Seminarraum)