This is a course that covers the key techniques in colouring sparse graphs. In particular, we will cover the Kostochka-Yancey Theorem, the Weak 3-flow theorem, the combinatorial nullstellensatz and list-colouring planar graphs, and flow-colour duality. By the end of the course, the student should have a good grasp of the techniques used in colouring sparse graphs.
Target group: This is a graduate course in graph theory. Anyone is welcome, although the main target will be those interested in combinatorics.
Prerequisites: Some knowledge of graph theory would useful, but none is required.
Evaluation: There will be a few assignments and possibly a presentation.
Teaching format: Lectures.
ECTS: 3 Year: 2023
Track segment(s):
Elective
Teacher(s):
Benjamin Moore
Teaching assistant(s):
If you want to enroll to this course, please click: REGISTER
- Teacher: Benjamin Moore