Matching minors in bipartite graphs

Matching minors in bipartite graphs
Author :
Publisher : Universitätsverlag der TU Berlin
Total Pages : 486
Release :
ISBN-10 : 9783798332522
ISBN-13 : 3798332525
Rating : 4/5 (525 Downloads)

Book Synopsis Matching minors in bipartite graphs by : Wiederrecht, Sebastian

Download or read book Matching minors in bipartite graphs written by Wiederrecht, Sebastian and published by Universitätsverlag der TU Berlin. This book was released on 2022-04-19 with total page 486 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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. In der vorliegenden Arbeit werden fundamentale Teile des Graphminorenprojekts von Robertson und Seymour für das Studium von Matching Minoren adaptiert und Verbindungen zur Strukturtheorie gerichteter Graphen aufgezeigt. Wir entwickeln matchingtheoretische Analogien zu etablierten Resultaten des Graphminorenprojekts: Wir charakterisieren die Existenz eines Kreuzes über einem konformen Kreis mittels topologischer Eigenschaften. Weiter entwickeln wir eine Theorie zu perfekter Matchingweite, einem Weiteparameter für Graphen mit perfekten Matchings, der von Norin eingeführt wurde. Hier zeigen wir, dass das Disjunkte Alternierende Pfade Problem auf bipartiten Graphen mit beschränkter Weite in Polynomialzeit lösbar ist. Weiter zeigen wir, dass jeder bipartite Graph mit hoher perfekter Matchingweite ein großes Gitter als Matchingminor enthalten muss. Schließlich zeigen wir ein Analogon des bekannten Flat Wall Theorem und geben eine qualitative Beschreibung aller bipartiter Graphen an, die einen festen Matching Minor ausschließen.


Matching minors in bipartite graphs Related Books

Matching minors in bipartite graphs
Language: en
Pages: 486
Authors: Wiederrecht, Sebastian
Categories: Computers
Type: BOOK - Published: 2022-04-19 - Publisher: Universitätsverlag der TU Berlin

GET EBOOK

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 t
Graph-Theoretic Concepts in Computer Science
Language: en
Pages: 413
Authors: Ignasi Sau
Categories: Mathematics
Type: BOOK - Published: 2019-09-11 - Publisher: Springer Nature

GET EBOOK

This book constitutes the revised papers of the 45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019, held in Vall de Núria, Sp
Perfect Matchings
Language: en
Pages: 584
Authors: Cláudio L. Lucchesi
Categories: Electronic books
Type: BOOK - Published: 2024 - Publisher: Springer Nature

GET EBOOK

Dualities in graphs and digraphs
Language: en
Pages: 294
Authors: Hatzel, Meike
Categories: Computers
Type: BOOK - Published: 2023-05-23 - Publisher: Universitätsverlag der TU Berlin

GET EBOOK

In this thesis we describe dualities in directed as well as undirected graphs based on tools such as width-parameters, obstructions and substructures. We mainly
Progress in Combinatorial Optimization
Language: en
Pages: 387
Authors: William R. Pulleyblank
Categories: Mathematics
Type: BOOK - Published: 2014-05-10 - Publisher: Academic Press

GET EBOOK

Progress in Combinatorial Optimization provides information pertinent to the fundamental aspects of combinatorial optimization. This book discusses how to deter