Perfect matchings of Fisher graphs of cubic graphs

DOI10.2206/KYUSHUJM.66.291MaRDI QIDQ4904988zbMATH OpenOpenAlexFDO

Authors 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

dimer modelentropyexact enumerationFisher constructionhigh temperature expansionIsing modelperfect matchings

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)

Recommendations

• Counting perfect matchings in the geometric dual
• On the expected number of perfect matchings in cubic planar graphs
• Antiferromagnetic Ising model in triangulations with applications to counting perfect matchings
• Expressions for the perfect matching numbers of cubic l m n lattices and their asymptotic values
• Dimer problem for some three dimensional lattice graphs

Cited in

(6)

• Antiferromagnetic Ising model in triangulations with applications to counting perfect matchings
• 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\)
• On the number of perfect matchings of middle graphs
• Enumerating perfect matchings in line graphs of graphs with pendent edges

This page was built for publication: Perfect matchings of Fisher graphs of cubic graphs

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