401-3052-05L Graph Theory
|Semester||Spring Semester 2019|
|Periodicity||yearly recurring course|
|Language of instruction||English|
|Abstract||Basic notions, trees, spanning trees, Caley's formula, vertex and edge connectivity, blocks, 2-connectivity, Mader's theorem, Menger's theorem, Eulerian graphs, Hamilton cycles, Dirac's theorem, matchings, theorems of Hall, König and Tutte, planar graphs, Euler's formula, basic non-planar graphs, graph colorings, greedy colorings, Brooks' theorem, 5-colorings of planar graphs|
|Objective||The students will get an overview over the most fundamental questions concerning graph theory. We expect them to understand the proof techniques and to use them autonomously on related problems.|
|Lecture notes||Lecture will be only at the blackboard.|
|Literature||West, D.: "Introduction to Graph Theory"|
Diestel, R.: "Graph Theory"
Further literature links will be provided in the lecture.
|Prerequisites / Notice||Students are expected to have a mathematical background and should be able to write rigorous proofs.|
NOTICE: This course unit was previously offered as 252-1408-00L Graphs and Algorithms.