DeepAI AI Chat
Log In Sign Up

Parameterizing the Permanent: Hardness for K_8-minor-free graphs

by   Radu Curticapean, et al.

In the 1960s, statistical physicists discovered a fascinating algorithm for counting perfect matchings in planar graphs. Valiant later showed that the same problem is #P-hard for general graphs. Since then, the algorithm for planar graphs was extended to bounded-genus graphs, to graphs excluding K_3,3 or K_5, and more generally, to any graph class excluding a fixed minor H that can be drawn in the plane with a single crossing. This stirred up hopes that counting perfect matchings might be polynomial-time solvable for graph classes excluding any fixed minor H. Alas, in this paper, we show #P-hardness for K_8-minor-free graphs by a simple and self-contained argument.


page 1

page 2

page 3

page 4


Excluding a Planar Matching Minor in Bipartite Graphs

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

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...

Killing a Vortex

The Structural Theorem of the Graph Minors series of Robertson and Seymo...

Counting Homomorphisms to K_4-minor-free Graphs, modulo 2

We study the problem of computing the parity of the number of homomorphi...

Counting Subgraphs in Degenerate Graphs

We consider the problem of counting the number of copies of a fixed grap...

Inference and Sampling of K_33-free Ising Models

We call an Ising model tractable when it is possible to compute its part...

Local certification of graph decompositions and applications to minor-free classes

Local certification consists in assigning labels to the nodes of a netwo...