On Counting Perfect Matchings in General Graphs
- 958 Downloads
Counting perfect matchings has played a central role in the theory of counting problems. The permanent, corresponding to bipartite graphs, was shown to be #P-complete to compute exactly by Valiant (1979), and a fully polynomial randomized approximation scheme (FPRAS) was presented by Jerrum, Sinclair, and Vigoda (2004) using a Markov chain Monte Carlo (MCMC) approach. However, it has remained an open question whether there exists an FPRAS for counting perfect matchings in general graphs. In fact, it was unresolved whether the same Markov chain defined by JSV is rapidly mixing in general. In this paper, we show that it is not. We prove torpid mixing for any weighting scheme on hole patterns in the JSV chain. As a first step toward overcoming this obstacle, we introduce a new algorithm for counting matchings based on the Gallai−Edmonds decomposition of a graph, and give an FPRAS for counting matchings in graphs that are sufficiently close to bipartite. In particular, we obtain a fixed-parameter tractable algorithm for counting matchings in general graphs, parameterized by the greatest “order” of a factor-critical subgraph.
This research was supported in part by NSF grants CCF-1617306, CCF-1563838, CCF-1318374, and CCF-1717349. The authors are grateful to Santosh Vempala for many illuminating conversations about Markov chains and the structure of factor-critical graphs.
- 1.Broder, A.Z.: How hard is it to marry at random? (On the approximation of the permanent). In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC), pp. 50–58 (1986). Erratum in Proceedings of the 20th Annual ACM Symposium on Theory of Computing, p. 551 (1988)Google Scholar
- 9.Kasteleyn, P.W.: Graph theory and crystal physics. In: Graph Theory and Theoretical Physics, pp. 43–110, Academic Press, London (1967)Google Scholar
- 11.Lovász, L.: A note on factor-critical graphs. Stud. Sci. Math. Hungar 7(11), pp. 279–280 (1972)Google Scholar