On counting perfect matchings in general graphs

DOI10.1007/978-3-319-77404-6_63OpenAlexW2963303432MaRDI QIDQ2294743

Eric Vigoda, John Wilmes, Daniel Štefanković

Publication date: 12 February 2020

Full work available at URL: https://arxiv.org/abs/1712.07504

zbMATH Keywords

Markov chainGallai-Edmonds decomposition of a graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (6)

Zero-freeness and approximation of real Boolean Holant problems ⋮ The mixing time of switch Markov chains: a unified approach ⋮ The Perfect Matching Reconfiguration Problem ⋮ Scaling matrices and counting the perfect matchings in graphs ⋮ Counting Perfect Matchings and the Switch Chain ⋮ Counting Weighted Independent Sets beyond the Permanent

This page was built for publication: On counting perfect matchings in general graphs