Webrelaunch 2020

How many colors needs a minor?

  • Speaker: Dr. Torsten Ueckerdt
  • Place: Kollegiengebäude Mathematik, Englerstraße 2, Seminarraum 1.067
  • Time: 13.12.2017, 16:30
  • Invited by: Prof. Dr. G. Last

Abstract

How many colors needs a minor? -- What looks like a question of a curious kid with a coloring book, is in fact one of the most important open problems in graph theory. In this talk I will first discuss the concept of a minor and his relative, the tree-width, and then talk about a result that many consider to be one of the cornerstones of graph theory.