Please note! Course description is confirmed for two academic years (1.8.2018-31.7.2020), which means that in general, e.g. Learning outcomes, assessment methods and key content stays unchanged. However, via course syllabus, it is possible to specify or change the course execution in each realization of the course, such as how the contact sessions are organized, assessment methods weighted or materials used.
The students will after the course understand the basic invariants of graphs and how they are related by regularity and structural graph theory.
Schedule: 07.09.2020 - 16.10.2020
Teacher in charge (valid 01.08.2020-31.07.2022): Alexander Engström
Teacher in charge (applies in this implementation):
Contact information for the course (applies in this implementation):
CEFR level (applies in this implementation):
Language of instruction and studies (valid 01.08.2020-31.07.2022):
Teaching language: English
Languages of study attainment: English
CONTENT, ASSESSMENT AND WORKLOAD
Basic properties as connectivity, planarity and minor containment. The Szemerédi regularity lemma and Ramsey theory; the graph minor theorem and the strong perfect graph theorem.
Assessment Methods and Criteria
Homework, possibly an exam.
Lectures and tutored problem solving 36h (3x2h/week, 6 weeks), self-study about 100h.
Graph Theory, Diestel, 5th edition.
Substitutes for Courses
Mathematical maturity comparable to a bachelor in computer science, mathematics or operational research.
SDG: Sustainable Development Goals
5 Gender Equality
9 Industry, Innovation and Infrastructure
- Teacher: Matteo Allaix