On the theory of Pfaffian orientations. I: Perfect matchings and permanents

zbMath0909.05005MaRDI QIDQ1277143

Martin Loebl, Anna Galluccio

Publication date: 2 February 1999

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119698

zbMATH Keywords

generating functionPfaffiangenusperfect matching

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items

Unnamed Item, On the asymptotics of dimers on tori, On the optimality of the Arf invariant formula for graph polynomials, Matching signatures and Pfaffian graphs, Discrete Dirac operators on Riemann surfaces and Kasteleyn matrices, The free-fermion eight-vertex model: couplings, bipartite dimers and \(Z\)-invariance, The Pfaffian property of circulant graphs, Identities between dimer partition functions on different surfaces, Maximum matchings in scale-free networks with identical degree distribution, Characterizing Valiant's algebraic complexity classes, Geometric representations of binary codes and computation of weight enumerators, Spanning trees of 3-uniform hypergraphs, The Pfaffian sign theorem for the dimer model on a triangular lattice, A Pfaffian formula for the monomer-dimer model on surface graphs, Dimer model: Full asymptotic expansion of the partition function, Geometric representations of linear codes, Counting the number of perfect matchings, and generalized decision trees, The geometry of dimer models, Matchings in graphs on non-orientable surfaces, Fermions and loops on graphs: II. A monomer–dimer model as a series of determinants, On the Pfaffian Number of Graphs, A Pfaffian formula for the Ising partition function of surface graphs, Tractable minor-free generalization of planar zero-field Ising models, Computation of sparse circulant permanents via determinants