MM855: Introduction to Graph Theory
MM855 is taught as part of MM856, and one can therefore only sign up for one of these courses.
Note that MM855 is run in the first half of the fall semester.
Students taking the course are expected to have basic knowledge of graph theory and discrete mathematics, corresponding to the material in the course MM541 (Combinatorial Mathematics).
- Give the competence to plan and execute complex scientific projects at a high level. This involves solving complex problems using tools from graph theory.
- Give skills to study, analyse, model and solve problems on a high level of abstraction using logical and structured argumentation.
- Give knowledge about advanced models and methods in graph theory
Expected learning outcome
- review definitions and results from graph theory.
- use the theory to solve concrete problems.
- give coherent solutions, arguing why the individual steps hold.
- carry out complete proofs for results from the course curriculum.
- explain connections between results and concepts in graph theory.
- Use graph algorithms in order to solve complex problems.
The following main topics are contained in the course: Graphs, trees, distances, matchings in general graphs, paths, cycles, colouring in graphs, Hamilton cycles and directed graphs.
Exam element a)
Allowed (Except internet). A closer description of the exam rules will be posted under 'Course Information' on Blackboard.
Indicative number of lessons
- Intro phase (lectures, question classes): 30 hours.
- Skills training phase (exercise sessions): 15 hours.
- Total = 45 hours.
|08 - 09|
|09 - 10|
|10 - 11|
|11 - 12|
|12 - 13|
|13 - 14|
|14 - 15|
|15 - 16|