Skip to content
Technische Universität Berlin Deutsch
Course catalog and module transfer system

Graph MinorsModule description #40935 / Version 1

← Module page Deutsche Fassung
Module / Version#40935 / #1
ValiditySince SS 2019
Available language(s)English
Credit points9
Person responsible for the moduleKreutzer, Stephan
GradingGraded
Exam formatOral exam
Language(s) of instructionEnglish

Affiliation

FacultyFakultät IV
InstituteInstitut für Softwaretechnik und Theoretische Informatik
Academic chair34352200 FG Logik und Semantik (LaS)

Contact

OfficeEN 24
Contact personPilz, Jana
E-mail addressstephan.kreutzer@tu-berlin.de
Websitehttps://www.tu.berlin/las

Learning outcomes

After completion of this course students will have a profound understanding of the concepts, ideas and intermediate steps of the proof of the graph minor structure theorem. They will be able to identify the main steps in the proof and will be able to apply these ideas and results in other areas and applications.

Content

Among the most important results in modern combinatorics is Robertson and Seymour's proof of the graph minor theorem, commonly known as Wagner's conjecture. One way of stating this result is as follows: in every infinite class of finite undirected simple graphs there are two graphs H and G such that H is a minor of G.

To prove this result, Robertson and Seymour developed a deep structure theory of graphs in terms of the graph minor relation. Several concepts, ideas and intermediate results developed as part of this theory have found numerous applications in other areas of mathematics, computer science and beyond. In fact, the impact of concepts such as the "tree width" of a graph and its dual concepts of "brambles" or "grid minors" has been so pervasive that one could say that entirely new fields of research have emerged based on these ideas.

The structure theory developed as part of the graph minor project culminates in Robertson and Seymour's famous structure theorem for graphs excluding a fixed minor. Informally it says that every graph G
1. is somewhat similar to a tree (formalised by the notion of "tree width") or
2. contains a large complete graph as a minor or
3. can be decomposed into a tree of subgraphs of (almost) bounded genus (slightly more pecisely: has a tree decomposition whose pieces can almost be embedded into a fixed surface (into which G itself cannot be embedded of course)).

This theorem is not only interesting from a structural perspective but has deep implication in the theory of graph algorithms.

Despite its enormous complexity, the proof of the structure theorem follows a clear route with clearly identifiable intermediate steps, which are important in their own right. Furthermore, many results along the way can be understood on an intuitive level and many of them can be applied algorithmically as a black-box. That is, even without understanding or even reading their proof one can apply them in many algorithmic settings.

Finally, many steps of the proof are not only very interesting, or important, the underlying concepts and ideas are often simply stunning in their mathematical beauty making the study of graph minors an exciting endeavour.

In this course we will cover all essential aspects of the proof of the graph minor structure theorem. Starting with essentially no prerequisites we will introduce the fundamental concepts of tree width and grid minors, surfaces and surface embeddings, and then develop the proof of the structure theorem over the period of the course.

Module components

Compulsory area

The following courses are mandatory for this module:

CoursesTypeNumberFrequencyLanguageHours per weekCourse catalog
Graph MinorsIntegrated course Irregular[en]6 ISIS

Workload and credit points

Graph Minors (Integrated course)

Workload descriptionMultiplierHoursTotal
Attendance156 h90 h
Pre/post processing1512 h180 h
270 h

The workload of the module adds up to 270 hours. The module therefore comprises 9 credit points.

Description of teaching and learning methods

The module is designed following the inverted class room model. After a few lectures recalling some basic concepts of graph and matroid theory, the students will follow a sequence of 18 videos taking them through the proof. After each video session there will be a tutorial style meeting in which various aspects of the proof step will be explored.

Requirements for participation and examination

Desirable prerequisites for participation in the courses:

The course will essentially introduce all concepts required for the course outcome. So only common knowledge of graph theory is required.
However, this is an extremely advanced course taking students into one of the most beautiful, but also most complex and deep theories of modern combinatorics/mathematics. Therefore, students should have a strong interest in graph theory and a very high level of mathematical maturity.

Mandatory requirements for the module examination registration:

This module has no examination requirements.

Completion of the module

GradingGraded
Exam formatOral exam
LanguageEnglish, German
Duration/Extent30-45 minutes

Duration of the module

The following number of semesters is estimated for taking and completing the module: 1 semester(s).

This module can be started in the following semesters: Winter and summer semester.

Maximum number of participants

This module is not limited to a number of students.

Registration procedures

Students will have to sign up for the exam in the usual way.

Recommended reading, lecture notes

Lecture notes

unavailable

Electronic lecture notes

available

Recommended literature

No recommended literature given

Assigned programs

This module version is used in the following programs:

Program / program versionSemester(s)Curriculum component
Computer Engineering
Computer Engineering (M. Sc.) - StuPO 2015
SS 2025Wahlpflicht Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing
WS 2025/26Wahlpflicht Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing
SS 2026Wahlpflicht Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing
WS 2026/27Wahlpflichtbereich › Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing
Computer Science (Informatik)
Computer Science (Informatik) (M. Sc.) - StuPO 2015
SS 2025Wahlpflicht Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing
WS 2025/26Studiengebiete › Grundlagen der Informatik / Foundations of Computing
SS 2026Studiengebiete › Grundlagen der Informatik / Foundations of Computing
WS 2026/27Wahlpflichtbereich › Studiengebiet › Grundlagen der Informatik / Foundations of Computing
Electrical Engineering
Electrical Engineering (M. Sc.) - StuPO 2015
SS 2025Wahlpflicht Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing
WS 2025/26Wahlpflicht Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing
SS 2026Wahlpflicht Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing
WS 2026/27Wahlpflichtbereich › Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing
Master of Computer Science
Master of Mathematics

Miscellaneous

Not specified