Mathematics III - Combinatorics
7.5 credits cr.
- Gå till denna sida på svenska webben
This course focuses mainly on graphs, which are structures used to model pairwise relations between objects. This has applications in many areas from computer science to linguistics. For instance, a graph can be used to model things like a social network or a nervous system.
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.
Like many of our courses in the Matematics III category, this course is sometimes given as a distance course and sometimes given on campus.
The course covers algorithms and their effectivity, general graph theory, trees and search algorithms, graph colouring, directed graphs, recursive methods, generating functions, partitions, finite geometries.
The course consists of one element, assessed with a written examination.
Instruction is given in the form of lectures and exercise sessions. There is also some video material available on the course web.
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.
A list of examiners can be found on
ScheduleThe schedule will be available no later than one month before the start of the course. We do not recommend print-outs as changes can occur. At the start of the course, your department will advise where you can find your schedule during the course.
Note that the course literature can be changed up to two months before the start of the course.
Grimaldi: Discrete and combinatorial mathematics, Classical edition. Addison-Wesley.