Combinatorial Theorem for Graphs on a Lattice

DOI10.1063/1.1664669MaRDI QIDQ5552135zbMATH OpenOpenAlexFDO

Authors John F. Nagle, H. N. V. Temperley

Publication date 1968

Published in Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1063/1.1664669

zbMATH Keywords

structure of matter

Mathematics Subject Classification ID

Applications of graph theory (05C90) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Recommendations

• Variations on the Ising problem
• Some combinatorial problems in statistical physics
• Combinatorial problems in the two-dimensional Ising model
• scientific article; zbMATH DE number 558563
• Using edge generating function to solve monomer-dimer problem

Cites work

• On the Spontaneous Magnetizations of Honeycomb and Kagomé Ising Lattices

Cited in

(4)

• scientific article; zbMATH DE number 558563 (Why is no real title available?)
• The 16-vertex model and its even and odd 8-vertex subcases on the square lattice
• scientific article; zbMATH DE number 5913 (Why is no real title available?)
• Quantum gravity and matter: counting graphs on causal dynamical triangulations

This page was built for publication: Combinatorial Theorem for Graphs on a Lattice

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