Dimer problem on cylinders: recurrences and generating functions

MaRDI QIDQ5261984zbMATH OpenFDO

Authors A. M. Karavaev, S. N. Perepechko

Publication date 8 July 2015

Full work available at URL http://mathnet.ru/eng/mm/v26/i11/p18

zbMATH Keywords

cylindrical net graphsgenerating functionsrecurrent relations

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

• Two counterparts of the TFK formula for cylinder graphs
• Generalized expression for the numbers of perfect matching of cylindrical m×n graphs
• Using edge generating function to solve monomer-dimer problem
• Linear recurrences for cylindrical networks
• Dimer problem for some three dimensional lattice graphs

Cited in

(4)

• A limit conjecture on the number of Hamiltonian cycles on thin triangular grid cylinder graphs
• The proof of the Perepechko’s conjecture concerning near-perfect matchings on Cm x Pn cylinders of odd order
• Mutually-recursive formulas for enumerating partitions of the rectangle
• Linear recurrences for cylindrical networks

This page was built for publication: Dimer problem on cylinders: recurrences and generating functions

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