How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs

DOI10.1016/0012-365X(92)90608-IzbMath0769.05077MaRDI QIDQ1197034

Horst Sachs

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

enumerationadjacency matrixplane graphperfect matchings

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Matching theory
• The statistics of dimers on a lattice
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs