Generalized expression for the numbers of perfect matching of cylindrical m×n graphs

DOI10.1063/1.529254zbMATH Open0736.05066OpenAlexW2085776335MaRDI QIDQ3980916FDOQ3980916

Authors: Hideyuki Narumi, Haruo Hosoya, Hiroshi Murakami 

Publication date: 26 June 1992

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

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

Recommendations

• Generalized expression of the perfect matching number for 2×3×n lattices
• Expressions for the perfect matching numbers of cubic \(l\times m\times n\) lattices and their asymptotic values
• An expression for the perfect matching number of cubic \(2\times m\times n\) lattices and their asymptotic values
• Dimer problem for some three dimensional lattice graphs
• Enumeration of perfect matchings of a type of quadratic lattice on the torus

zbMATH Keywords

latticeIsing modeldimers

Mathematics Subject Classification ID

Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
• Dimer problem in statistical mechanics-an exact result
• An effective algorithm for obtaining polynomials for dimer statistics. Application of operator technique on the topological index to two- and three-dimensional rectangular and torus lattices
• Justification of Vdovichenko's method for the Ising model on a two-dimensional lattice.

Cited In (6)

• Expressions for the perfect matching numbers of cubic \(l\times m\times n\) lattices and their asymptotic values
• The proof of the Perepechko’s conjecture concerning near-perfect matchings on Cm x Pn cylinders of odd order
• Generalized expression of the perfect matching number for 2×3×n lattices
• Two counterparts of the TFK formula for cylinder graphs
• Dimer problem on cylinders: recurrences and generating functions
• An expression for the perfect matching number of cubic \(2\times m\times n\) lattices and their asymptotic values

This page was built for publication: Generalized expression for the numbers of perfect matching of cylindrical m×n graphs

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