Abstract
An orientation of a graph G with even number of vertices is Pfaffian if every even cycle C such that G − V (C) has a perfect matching has an odd number of edges directed in either direction of the cycle. The significance of Pfaffian orientations stems from the fact that if a graph G has one, then the number of perfect matchings of G can be computed in polynomial time. There is a classical result of Kasteleyn that every planar graph has a Pfaffian orientation. Little proved an elegant characterization of bipartite graphs that admit a Pfaffian orientation. Robertson, Seymour and Thomas (1999) gave a polynomial-time recognition algorithm to test whether a bipartite graph is Pfaffian by a structural description of bipartite graphs. In this paper, we consider the Pfaffian property of graphs embedding on the orientable surface with genus one (i.e., the torus). Some sufficient conditions for Pfaffian graphs on the torus are obtained. Furthermore, we show that all quadrilateral tilings on the torus are Pfaffian if and only if they are not bipartite graphs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bollobás B. Mordern Graph Theory. Grad Texts in Math 184. New York: Springer-Verlag, 1998
Diestel R. Graph Theory. Grad Texts in Math 173. Berlin: Springer-Verlag, 2005
Firby P A, Gardiner C F. Surface Topology, 2nd ed. Ellis Horwood Ser Math Appl. New York: Ellis Horwood, 1991
Fischer I, Little C H C. A characterization of Pfaffian near bipartite graphs. J Combin Theory Ser B, 2001, 82: 175–222
Fisher M E. Statistical mecanics of dimers on a plane lattice. Phys Rev, 1961, 124: 1664–1672
Kasteleyn P W. The statistics of dimers on a lattice I: The number of dimer arrangements on a quadratic lattice. Physica, 1961, 27: 1209–1225
Kasteleyn P W. Graph theory and crystal physics. In: Harary F, ed. Graph Theory and Theoretical Physics. London: Academic Press, 1967, 43–110
Little C H C. A characterization of convertible (0, 1)-matrices. J Combin Theory, 1975, 18: 187–208
Liu Y P. Surface embeddability of graphs via homology. Sci China Math, 2010, 53: 2889–2892
Lovász L, Plummer M. Matching Theory. Ann of Discrete Math 29. New York: North-Holland, 1986
Lu F L, Zhang L Z, Lin F G. Enumeration of perfect matchings of a type of quadratic lattice on the torus. Electron J Combin, 2010, 17: R36
Lu W T, Wu F Y. Close-packed dimers on nonorientable surfaces. Phys Lett A, 2002, 293: 235–246
McCuaig W. Pólya’s permanent problem. Electron J Combin, 2004, 11: R79
Munkres J R. Elements of Algebraic Topology. Menlo Park: Addison-Wesley, 1984
Robertson N, Seymour P D, Thomas R. Permanents, Pfaffian orientations, and even directed circuits. Math Ann, 1999, 150: 929–975
Tesler G. Matchings in graphs on non-orientable surfaces. J Combin Theory Ser B, 2000, 78: 198–231
Thomas R. A survey of Pfaffian orientations of graphs. In: International Congress of Mathematicians, vol. III. Zurich: European Math Soc, 2006, 963–984
Thomassen C. Tilings of the torus and the klein bottle and vertex-transitive graphs on a fixed surface. Trans Amer Math Soc, 1991, 323: 605–635
Valiant L G. The complexity of computing the permanent. Theoret Comput Sci, 1979, 8: 189–201
Wang F R, Du S F. Nonorientable regular embeddings of graphs of order pq. Sci China Math, 2011, 54: 351–363
West D. Introduction to Graph Theory. Upper Saddle River: Prentice-Hall, 2001
Yan W G, Yeh Y N, Zhang F J. Dimer problem on the cylinder and torus. Physica A, 2008, 387: 6069–6078
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, L., Wang, Y. & Lu, F. Pfaffian graphs embedding on the torus. Sci. China Math. 56, 1957–1964 (2013). https://doi.org/10.1007/s11425-012-4561-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11425-012-4561-1