Graph theory
Basic concepts of graph theory: degree, distance, diameter, matching etc. Theory for matchings, in particular for bipartite graphs. Structure theorems about 2- and 3- connected components of graphs, also Mader's and Menger's Theorems. Theory about minors, planarity. Colouring of various kinds, Perfect graphs, Hadwiger's conjecture, random graphs and the probabilistic method.
This course replaces MM8011 Combinatorics III.
This course is given jointly with KTH, and information about schedule, course literature etc. can be found on KTH's pages - see links below.
The course consists of one element.
Teaching Format
Instruction is given in the form of lectures and exercises.
Assessment
The course is assessed through written and oral examination.
For information on how to register for exams at KTH, see:
Examiner
A list of examiners can be found on
Note that semesters do not always start on the same day at Stockholm University and KTH, so this course may begin before the official first day of the semester at Stockholm University.
New student
During your studies
Note that if you have applied to and are admitted to this course, you register for the course at Stockholm University, not KTH.
Course web
The course web can be found at KTH. Registered students get access to the KTH course web in Canvas.





