Matching minors in bipartite graphs

• Main Author: Wiederrecht, Sebastian (auth)
• Format: Electronic Book Chapter
• Language: English
• Published: Berlin Universitätsverlag der Technischen Universität Berlin 2022
• Series: Foundations of computing
• Subjects: Algorithms & data structures; matching minor; structural graph theory; bipartite; perfect matching
• Online Access: DOAB: download the publication; DOAB: description of the publication

In this thesis we adapt fundamental parts of the Graph Minors series of Robertson and Seymour for the study of matching minors and investigate a connection to the study of directed graphs. We develope matching theoretic to established results of graph minor theory: We characterise the existence of a cross over a conformal cycle by means of a topological property. Furthermore, we develope a theory for perfect matching width, a width parameter for graphs with perfect matchings introduced by Norin. here we show that the disjoint alternating paths problem can be solved in polynomial time on graphs of bounded width. Moreover, we show that every bipartite graph with high perfect matching width must contain a large grid as a matching minor. Finally, we prove an analogue of the we known Flat Wall theorem and provide a qualitative description of all bipartite graphs which exclude a fixed matching minor.