Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs

by   Roman Rabinovich, et al.

A connected graph G is called matching covered if every edge of G is contained in a perfect matching. Perfect matching width is a width parameter for matching covered graphs based on a branch decomposition. It was introduced by Norine and intended as a tool for the structural study of matching covered graphs, especially in the context of Pfaffian orientations. Norine conjectured that graphs of high perfect matching width would contain a large grid as a matching minor, similar to the result on treewidth by Robertson and Seymour. In this paper we obtain the first results on perfect matching width since its introduction. For the restricted case of bipartite graphs, we show that perfect matching width is equivalent to directed treewidth and thus the Directed Grid Theorem by Kawarabayashi and Kreutzer for directed implies Norine's conjecture.



There are no comments yet.


page 1

page 2

page 3

page 4


Braces of Perfect Matching Width 2

A graph G is called matching covered if it is connected and every edge i...

Excluding a Planar Matching Minor in Bipartite Graphs

Matching minors are a specialisation of minors fit for the study of grap...

Adapting the Directed Grid Theorem into an FPT Algorithm

The Grid Theorem of Robertson and Seymour [JCTB, 1986], is one of the mo...

How many matchings cover the nodes of a graph?

Given an undirected graph, are there k matchings whose union covers all ...

A Flat Wall Theorem for Matching Minors in Bipartite Graphs

A major step in the graph minors theory of Robertson and Seymour is the ...

Constant congestion brambles in directed graphs

The Directed Grid Theorem, stating that there is a function f such that ...

Bipartite Perfect Matching as a Real Polynomial

We obtain a description of the Bipartite Perfect Matching decision probl...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.