PERFECT MATCHINGS OF FISHER GRAPHS OF CUBIC GRAPHS

DOI10.2206/KYUSHUJM.66.291zbMath1260.82012OpenAlexW1975629704MaRDI QIDQ4904988

Yan Liu, Chunxia Yang, Mihai Ciucu

Publication date: 14 February 2013

Published in: Kyushu Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2206/kyushujm.66.291

zbMATH Keywords

entropyIsing modelexact enumerationperfect matchingsdimer modelhigh temperature expansionFisher construction

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items (3)

Weighted graphs, spanning tree generating functions and anisotropic lattice systems: illustrative results for the Ising and dimer models ⋮ On the dimer problem of the vertex-edge graph of a cubic graph ⋮ Enumeration of perfect matchings of the middle graph of a graph \(G\) with \(\triangle (G) \leq 4\)

This page was built for publication: PERFECT MATCHINGS OF FISHER GRAPHS OF CUBIC GRAPHS