How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs
type: Item
instance of: scholarly article
title: How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs
zbMATH Open document ID: 0769.05077
DOI: 10.1016/0012-365X(92)90608-I
author: Horst Sachs
published in: Discrete Mathematics
publication date: 1993-01-16T00:00:00Z
review text: By Kasteleyn's formula the number of perfect matchings in a plane graph \(G\) can be expressed by the determinant of a certain matrix related to the adjacency matrix of \(G\). In this paper a simplification is suggested which is very efficient for sections of certain infinite plane graphs.
reviewed by: Ján Plesník
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 89908
zbMATH Keywords: enumeration
zbMATH Keywords: perfect matchings
zbMATH Keywords: plane graph
zbMATH Keywords: adjacency matrix
MaRDI profile type: Publication
cites work: Q3972513
cites work: Q5187323
cites work: Q5749300
cites work: The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
cites work: Q5605168
cites work: Matching theory
cites work: Q3972015
Recommended article: Q3751615
Recommended article: On counting perfect matchings in general graphs
Recommended article: Counting perfect matchings in \(n\)-extendable graphs
Recommended article: Q3170050
Recommended article: A quadratic identity for the number of perfect matchings of plane graphs
Recommended article: On the upper bounds of the numbers of perfect matchings in graphs with given parameters
Recommended article: The enumeration of perfect matchings in two types of graphs
Recommended article: Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
Recommended article: Q3132368
description: scientific article; zbMATH DE number 89908