On the number of matchings in regular graphs
From MaRDI portal
Publication:1010842
zbMath1181.05011arXiv0801.2256MaRDI QIDQ1010842
Shmuel Friedland, Klas Markström, Elliot Krop
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0801.2256
05C80: Random graphs (graph-theoretic aspects)
05A15: Exact enumeration problems, generating functions
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
82B20: Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics
05A16: Asymptotic enumeration
Related Items
Matchings in regular graphs: minimizing the partition function, Tight bounds on the coefficients of partition functions via stability, Tight bounds on the coefficients of partition functions via stability, Counting matchings via capacity-preserving operators, Asymptotics of the upper matching conjecture, Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges, Matchings in vertex-transitive bipartite graphs, Covers, orientations and factors, Positivity of the virial coefficients in lattice dimer models and upper bounds on the number of matchings on graphs, A positivity property of the dimer entropy of graphs, A proof of the upper matching conjecture for large graphs, A mysterious cluster expansion associated to the expectation value of the permanent of \(0\)-\(1\) matrices, \(1/n\) expansion for the number of matchings on regular graphs and Monomer-Dimer entropy, Spectral moments of regular graphs in terms of subgraph counts, Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems, Results and questions on matchings in abelian groups and vector subspaces of fields, Matchings in Benjamini–Schramm convergent graph sequences, Statistical Matching Theory
