Abstract
The determinant method of Kasteleyn gives a method of computing the number of perfect matchings of a planar bipartite graph. In addition, results of Bernardi exhibit a bijection between spanning trees of a planar bipartite graph and elements of its Jacobian. In this paper, we explore an adaptation of Bernardi’s results, providing a simply transitive group action of the Kasteleyn cokernel of a planar bipartite graph on its set of perfect matchings, when the planar bipartite graph in question is of the form $$G^+$$ , as defined by Kenyon, Propp and Wilson.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
