Dublin Core
Title
Matching minors in bipartite graphs
Subject
matching minor
Description
n 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.
Creator
Wiederrecht, Sebastian cc
Source
https://library.oapen.org/handle/20.500.12657/57270
Publisher
Publisher: Universitätsverlag der Technischen Universität Berlin
Publisher website: https://verlag.tu-berlin.de/
Date
2022
Contributor
Tatik
Rights
https://creativecommons.org/licenses/by/4.0/
Format
PDF
Language
English
Type
Texkbooks
Identifier
DOI: 10.14279/depositonce-14958
ISBN: 9783798332522, 9783798332539