Graph explorer

Dimers and Dominoes

Using Kasteleyn's determinant method, we count perfect matchings of rectangular subgraphs of the square grid.

3 nodes2 linksoverview mapDimers and Dominoes
3 nodes2 links
Dimers and Dominoes3 visible / 3 total nodes / 2 links
AuthorshipTopic signalWDimers and Dominoespreprint / 2014AJames ProppResearcherTmath.CO8936 works
PaperSignal 102 links

Dimers and Dominoes

preprint / 2014

Open