On the Theory of Pfaffian Orientations. II. $T$-joins, $k$-cuts, and Duality of Enumeration
On the Theory of Pfaffian Orientations. II. $T$-joins, $k$-cuts, and Duality of Enumeration
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating functions of $T$-joins and $k$-cuts of graphs. As a consequence, we show that the computational problem to find the maximum weight of an …