Prefer a chat interface with context about you and your work?
On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus $g$ may be written as a linear combination of $4^g$ Pfaffians. Here we prove this statement. As a consequence we present a combinatorial way to compute the permanent of a square matrix.