Matchings in vertex-transitive bipartite graphs
From MaRDI portal
Publication:502979
DOI10.1007/s11856-016-1375-9zbMath1352.05149arXiv1407.5409OpenAlexW1485502831MaRDI QIDQ502979
Publication date: 11 January 2017
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.5409
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items (max. 100)
Matchings on trees and the adjacency matrix: A determinantal viewpoint ⋮ Statistical Matching Theory ⋮ Atoms of the matching measure
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An asymptotic expansion and recursive inequalities for the monomer-dimer problem
- Computation of terms in the asymptotic expansion of dimer \(\lambda_d\) for high dimension
- Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy
- Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all
- On the number of matchings in regular graphs
- Alternating-sign matrices and domino tilings. I
- The Holens-Đoković conjecture on permanents fails!
- Counting 1-factors in regular bipartite graphs
- Approximating the number of monomer-dimer coverings of a lattice.
- A positivity property of the dimer entropy of graphs
- Dimers and amoebae
- Theory of monomer-dimer systems
- Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
- A variational principle for domino tilings
- Matchings in Benjamini–Schramm convergent graph sequences
- The statistics of dimers on a lattice
- On Leonid Gurvits’s Proof for Permanents
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- Approximating the Permanent
- Dimer problem in statistical mechanics-an exact result
- On the Distribution of the Number of Successes in Independent Trials
This page was built for publication: Matchings in vertex-transitive bipartite graphs
