Using edge generating function to solve monomer-dimer problem

DOI10.1016/J.AAM.2020.102082MaRDI QIDQ2221757zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Monomer-dimer problem on some networks
• On the monomer-dimer problem of some graphs
• Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices
• Study of dimer-monomer on the generalized Hanoi graph
• Solution of the monomer-dimer model on locally tree-like graphs. Rigorous results
• An asymptotic expansion and recursive inequalities for the monomer-dimer problem
• Monomer-dimer problem on random planar honeycomb lattice
• State matrix recursion method and monomer-dimer problem
• Approximating the number of monomer-dimer coverings of a lattice.
• A Pfaffian formula for monomer-dimer partition functions

Cites work

• scientific article; zbMATH DE number 3326387 (Why is no real title available?)
• Antiferromagnetism. The Triangular Ising Net
• Dimer problem in statistical mechanics-an exact result
• Enumeration of matchings in families of self-similar graphs
• Enumeration of perfect matchings of a type of Cartesian products of graphs
• Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
• Enumeration problems for classes of self-similar graphs
• Matching polynomials and duality
• Matching theory
• Monomer-dimer problem on random planar honeycomb lattice
• Monomer-dimer problem on some networks
• On the matching polynomial of subdivision graphs
• On the monomer-dimer problem of some graphs
• On the number of matchings of graphs formed by a graph operation
• Problems in algebraic combinatorics
• Statistical Mechanics of Dimers on a Plane Lattice
• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
• Theory of monomer-dimer systems
• Weighted enumeration of spanning subgraphs with degree constraints

Cited in

(6)

• Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices
• Combinatorial Theorem for Graphs on a Lattice
• On the monomer-dimer problem of some graphs
• The monomer-dimer problem and moment Lyapunov exponents of homogeneous Gaussian random fields
• Computing the matching and independence polynomials of double hexagonal chains
• Dimer problem on cylinders: recurrences and generating functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2221757)