The IBS discrete mathematics group welcomes Dr. Sebastian Wiederrecht, a new research fellow at the IBS discrete mathematics group from July 16, 2022. He received his Ph.D. from Technische Universität Berlin under the supervision of Prof. Stephan Kreutzer. He is interested in graph theory, in particular the structural matching theory.
Sebastian Wiederrecht gave an online talk on matching minors in biparite graphs at the Virtual Discrete Math Colloquium
On November 11, 2021, Sebastian Wiederrecht from LIRMM gave an online talk at the Virtual Discrete Math Colloquium on building the graph structure theory for matching minors. The title of his talk was “Matching Minors in Bipartite Graphs“.
Sebastian Wiederrecht, Matching Minors in Bipartite Graphs
Matching minors are a specialisation of minors which preserves the existence and elementary structural properties of perfect matchings. They were first discovered as part of the study of the Pfaffian recognition problem on bipartite graphs (Polya’s Permanent Problem) and acted as a major inspiration for the definition of butterfly minors in digraphs. In this talk we consider the origin and motivation behind the study of matching minors, the current state of the art, and their relation to structural digraph theory. The main result is a generalisation of the structure theorem by Robertson et al. and McCuaig for