Weighted Counting of Matchings in Unbounded-Treewidth Graph Families

Antoine Amarilli, Mikaël Monet

We consider a weighted counting problem on matchings, denoted $\text{PrMatching}(\mathcal{G})$, on an arbitrary fixed graph family $\mathcal{G}$. The input consists of a graph $G…