Mathematics III - Combinatorics

About this programme

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. Instruction is given in the form of lectures and exercise sessions. There is also some video material available on the course web. 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. Grimaldi: Discrete and combinatorial mathematics, Classical edition. Addison-Wesley. To follow your passion. To be close to international career opportunities. To explore city and countryside. In Stockholm you can really get the best of both worlds. Here we explain all the different steps you need to go through when applying to a course or programme. Stockholm University arranges regular webinars and participates in educational fairs and events virtually and around the world to meet students and inform them about our study programmes. Every year Stockholm University welcomes thousands of international students from all over the world. Each bringing their own backpa