Dimers and Dominoes
classification
🧮 math.CO
keywords
countdeterminantdimersdominoesgridkasteleynmatchingsmethod
read the original abstract
Using Kasteleyn's determinant method, we count perfect matchings of rectangular subgraphs of the square grid.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.