Using edge generating function to solve monomer-dimer problem

DOI10.1016/j.aam.2020.102082zbMath1456.05008OpenAlexW3045259165MaRDI QIDQ2221757

Guoce Xin, Weigen Yan

Publication date: 2 February 2021

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2020.102082

zbMATH Keywords

matchingperfect matchingmonomer-dimer problemedge generating functionmonomer-dimer generating function

Mathematics Subject Classification ID

Applications of graph theory (05C90) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items (1)

Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices

Cites Work

• Unnamed Item
• Matching polynomials and duality
• Enumeration of matchings in families of self-similar graphs
• On the number of matchings of graphs formed by a graph operation
• On the matching polynomial of subdivision graphs
• Weighted enumeration of spanning subgraphs with degree constraints
• Matching theory
• Problems in algebraic combinatorics
• Monomer-dimer problem on some networks
• Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
• Enumeration problems for classes of self-similar graphs
• Theory of monomer-dimer systems
• Enumeration of perfect matchings of a type of Cartesian products of graphs
• The statistics of dimers on a lattice
• Statistical Mechanics of Dimers on a Plane Lattice
• On the Monomer–Dimer Problem of Some Graphs
• Dimer problem in statistical mechanics-an exact result
• Monomer-dimer problem on random planar honeycomb lattice
• Antiferromagnetism. The Triangular Ising Net

This page was built for publication: Using edge generating function to solve monomer-dimer problem