Pfaffian orientation

Left: The 3 cycles of the graph, shown red, along with a matching of the remaining graph after removing the cycle. The cycles are "even" because they have an even number of edges, and are "central" because a perfect matching is able to be created with the remaining graph (cycle 3 leaves no vertices, automatically filling this criterion).

Right: A Pfaffian Orientation of the graph on the left, where the edges of the 3 cycles from the right have an odd number going in each direction around the cycle. The red and blue arrows are clockwise and counter-clockwise respectively for all cycles, and the black arrow is counter-clockwise relative to cycle 1 and clockwise relative to cycle 2.

In graph theory, a Pfaffian orientation of an undirected graph assigns a direction to each edge, so that certain cycles (the "even central cycles") have an odd number of edges in each direction. When a graph has a Pfaffian orientation, the orientation can be used to count the perfect matchings of the graph. This is the main idea behind the FKT algorithm for counting perfect matchings in planar graphs, which always have Pfaffian orientations. More generally, every graph that does not have the utility graph as a graph minor has a Pfaffian orientation, but does not, nor do infinitely many other minimal non-Pfaffian graphs.