Discrete Mathematics

Postgraduate course

Course description

Objectives and Content

The subject gives an introduction to combinatorial structures on finite sets. One part consists of counting theory, binomial coefficients, recursion formulas and generating functions. The other part consists of graph theory, paths and circuits, trees, planarity, and colouring.

Learning Outcomes

To provide the students with basic knowledge of graph theory and counting theory. The subject is useful for further studies in mathematics and informatics.

Level of Study


Semester of Instruction

Recommended Previous Knowledge
Credit Reduction due to Course Overlap
MAT611: 10 ECTS
Compulsory Assignments and Attendance
Forms of Assessment

Written examination: 4 hours

Examination support materials: Non- programmable calculator, according to model listed in faculty regulations

Grading Scale
The grading scale used is A to F. Grade A is the highest passing grade in the grading scale, grade F is a fail.