DeepAI AI Chat
Log In Sign Up

Excluding Single-Crossing Matching Minors in Bipartite Graphs

By a seminal result of Valiant, computing the permanent of (0,1)-matrices is, in general, #𝖯-hard. In 1913 Pólya asked for which (0,1)-matrices A it is possible to change some signs such that the permanent of A equals the determinant of the resulting matrix. In 1975, Little showed these matrices to be exactly the biadjacency matrices of bipartite graphs excluding K_3,3 as a {matching minor. This was turned into a polynomial time algorithm by McCuaig, Robertson, Seymour, and Thomas in 1999. However, the relation between the exclusion of some matching minor in a bipartite graph and the tractability of the permanent extends beyond K_3,3. Recently it was shown that the exclusion of any planar bipartite graph as a matching minor yields a class of bipartite graphs on which the permanent of the corresponding (0,1)-matrices can be computed efficiently. In this paper we unify the two results above into a single, more general result in the style of the celebrated structure theorem for single-crossing-minor-free graphs. We identify a class of bipartite graphs strictly generalising planar bipartite graphs and K_3,3 which includes infinitely many non-Pfaffian graphs. The exclusion of any member of this class as a matching minor yields a structure that allows for the efficient evaluation of the permanent. Moreover, we show that the evaluation of the permanent remains #𝖯-hard on bipartite graphs which exclude K_5,5 as a matching minor. This establishes a first computational lower bound for the problem of counting perfect matchings on matching minor closed classes.

READ FULL TEXT

page 37

page 38

06/01/2021

Excluding a Planar Matching Minor in Bipartite Graphs

Matching minors are a specialisation of minors fit for the study of grap...
07/11/2022

Killing a Vortex

The Structural Theorem of the Graph Minors series of Robertson and Seymo...
05/03/2018

How to Secure Matchings Against Edge Failures

The matching preclusion number of a graph is the minimal number of edges...
08/08/2019

On Symbolic Approaches for Computing the Matrix Permanent

Counting the number of perfect matchings in bipartite graphs, or equival...
02/05/2020

Graph matching between bipartite and unipartite networks: to collapse, or not to collapse, that is the question

Graph matching consists of aligning the vertices of two unlabeled graphs...
01/31/2018

NC Algorithms for Perfect Matching and Maximum Flow in One-Crossing-Minor-Free Graphs

In 1988, Vazirani gave an NC algorithm for computing the number of perfe...
03/25/2021

Reachability and Matching in Single Crossing Minor Free Graphs

We construct in Logspace non-zero circulations for H-minor free graphs w...