# 401-3052-05L Graph Theory

Semester | Spring Semester 2016 |

Lecturers | B. Sudakov |

Periodicity | yearly recurring course |

Language of instruction | English |

Abstract | Basic notions, . Trees, spanning trees, Caley formula, Vertex and edge connectivity, blocks, 2-connectivity, Maders theorem, Mengers theorem, Euleraing graphs, Hamilton cycle, Dirac theorem, Matchings, theorem of Hall, Konig, Tutte, Planar graph, Euler's formula, Basic non-planar graphs, Graph colorings, greedy, 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 | NOTICE: This course unit was previously offered as 252-1408-00L Graphs and Algorithms. |