Sciweavers

Share
COMBINATORICS
1999

On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents

8 years 4 months ago
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 4g Pfaffians. Here we prove this statement. As a consequence we present a combinatorial way to compute the permanent of a square matrix. Mathematical Reviews Subject Numbers 05B35, 05C15, 05A15 Supported by NATO-CNR Fellowship Supported by DONET, GACR 0194 and GAUK 194 1
Anna Galluccio, Martin Loebl
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 1999
Where COMBINATORICS
Authors Anna Galluccio, Martin Loebl
Comments (0)
books