$\vec{w}h\alpha\mathfrak{t}\;\; i\mathbb{S}\ldots$

a tree-decomposition?

Raphael Steiner (TU Berlin)
2021/04/16, 14:00
Before the MATH+ Friday Colloquium by Prof. Maria Chudnovsky (abstract, video recording)
Due to the current situation, the talk takes place online, via zoom. The meeting link has been sent out via the usual mailing lists; please contact the organisers if you have not received the email and would like to join the talk.
About what?

In the talk I explain the definition of a tree decomposition of a graph, and using simple examples I illustrate some of the intuition behind this important combinatorial concept, which is useful in computer science for designing efficient algorithms as well as in structural graph theory as a tool for proving theoretical results.