Minimally non-Pfaffian graphs

We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sharp contrast with the bipartite case, as Little [C.H.C. Little, A characterization of convertible (0,1)-matrices, J. Combin. Theory Ser. B 18 (1975) 187-208] proved that every bipartite non-Pfaffian graph contains a matching minor isomorphic to K"3","3. We relax the notion of a matching minor and conjecture that there are only finitely many (perhaps as few as two) non-Pfaffian graphs minimal with respect to this notion. We define Pfaffian factor-critical graphs and study them in the second part of the paper. They seem to be of interest as the number of near perfect matchings in a Pfaffian factor-critical graph can be computed in polynomial time. We give a polynomial time recognition algorithm for this class of graphs and characterize non-Pfaffian factor-critical graphs in terms of forbidden central subgraphs.

[1]  Robin Thomas,et al.  A survey of Pfaffian orientations of graphs , 2006 .

[2]  G. Sposito,et al.  Graph theory and theoretical physics , 1969 .

[3]  Ilse Fischer,et al.  A Characterisation of Pfaffian Near Bipartite Graphs , 2001, J. Comb. Theory, Ser. B.

[4]  Robin Thomas,et al.  PERMANENTS, PFAFFIAN ORIENTATIONS, AND EVEN DIRECTED CIRCUITS , 1997, STOC 1997.

[5]  R. Richardson.  The International Congress of Mathematicians , 1932, Science.

[6]  P. W. Kasteleyn.  Dimer Statistics and Phase Transitions , 1963 .

[7]  Mihalis Yannakakis,et al.  Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs , 1989, Discret. Appl. Math..

[8]  L. Lovász.  Matching Theory (North-Holland mathematics studies) , 1986 .

[9]  M. Fisher.  Statistical Mechanics of Dimers on a Plane Lattice , 1961 .

[10]  William McCuaig,et al.  Pólya's Permanent Problem , 2004, Electron. J. Comb..

[11]  C. Little.  A characterization of convertible (0, 1)-matrices , 1975 .

[12]  László Lovász,et al.  Brick decompositions and the matching rank of graphs , 1982, Comb..

[13]  J. Edmonds,et al.  Facets of I-matching polyhedra , 1974 .

[14]  László Lovász,et al.  Matching structure and the matching lattice , 1987, J. Comb. Theory, Ser. B.

[15]  P. W. Kasteleyn.  The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice , 1961 .

[16]  Franz Rendl,et al.  Towards a characterisation of Pfaffian near bipartite graphs , 2002, Discret. Math..

[17]  Robin Thomas,et al.  Generating bricks , 2007, J. Comb. Theory, Ser. B.