Results from exam

Fristående och okodade
Kandidatprogram/ma (kodade)

Canceled lecture Fri Dec due to schema mistake - I'm very sorry

Files

Course plan

Extra material

On colourings you should also read the proofs of Brook's theorem and the 5-color theorem in Diestel Chapter 5.

On Network flows you could also read the section on Minimum-Cost flows in Larsen et. al.. Especially to understand the overall workings of the Network Simplex method for simple transhipment problems.

Lecture notes

Problem Sessions

Guidelines for problem sheets and bonus

Dates for problem sessions: First: Mon 21 Nov, Second Thu 1 Dec, Third Thu 8 Dec, Fourth Fri 16 Dec

Problem sheet 1

Problem sheet 2

Problem sheet 3

Problem sheet 4 (Exam type questions)

Problem sheet 4 With Solutions (Exam type questions)

Alternative and supplementary literature

Links