Mathematics III - Combinatorics
In this course you will learn to define basic concepts, and prove basic theorems, in combinatorics and graph theory, and to explain and use methods in combinatorics and graph theory to solve mathematical and applied problems.
This course is sometimes given as a distance course and sometimes given on campus.
Course contents: The course covers algorithms and their effectivity, general graph theory, trees and search algorithms, graph colouring, directed graphs, recursive methods, generating functions and partitions.
The course consists of one element, assessed with a written examination.
Teaching Format
Instruction is given in the form of lectures and exercise sessions. There is also some video material available on the course web.
Assessment
The course is assessed through written examination.
Assessment when the course is given as a distance course
Even when the course is given as a distance course, the exam is on campus. If you cannot come to Stockholm for the exam, you may be able to arrange to take the exam elsewhere, e.g. at another university or (if you are not in Sweden) at a Swedish embassy or consulate.
Examiner
A list of examiners can be found on
Grimaldi: Discrete and combinatorial mathematics, Classical edition. Addison-Wesley.
New student
During your studies
Course web
We do not use Athena, you can find our course webpages on kurser.math.su.se.





