Counting matchings in irregular bipartite graphs and random lifts
From MaRDI portal
Publication:4575894
DOI10.1137/1.9781611974782.146zbMath1410.05168arXiv1507.04739OpenAlexW2144865572MaRDI QIDQ4575894
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.04739
Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems ⋮ Matchings on trees and the adjacency matrix: A determinantal viewpoint ⋮ Equitable partition for some Ramanujan graphs ⋮ Statistical Matching Theory ⋮ A generalization of permanent inequalities and applications in counting and optimization ⋮ Tight bounds on the coefficients of partition functions via stability ⋮ Gauges, loops, and polynomials for partition functions of graphical models ⋮ A short survey on stable polynomials, orientations and matchings
This page was built for publication: Counting matchings in irregular bipartite graphs and random lifts
