Pages that link to "Item:Q1277143"

The following pages link to On the theory of Pfaffian orientations. I: Perfect matchings and permanents (Q1277143):

Displaying 34 items.

• On the asymptotics of dimers on tori (Q343799) (← links)
• Pfaffian graphs embedding on the torus (Q382787) (← links)
• Discrete Dirac operators on Riemann surfaces and Kasteleyn matrices (Q437817) (← links)
• Computing the permanental polynomials of bipartite graphs by Pfaffian orientation (Q442233) (← links)
• The Pfaffian property of circulant graphs (Q479041) (← links)
• Face-width of Pfaffian braces and polyhex graphs on surfaces (Q490246) (← links)
• Maximum matchings in scale-free networks with identical degree distribution (Q528496) (← links)
• On the optimality of the Arf invariant formula for graph polynomials (Q610678) (← links)
• Matching signatures and Pfaffian graphs (Q626770) (← links)
• Spanning trees of 3-uniform hypergraphs (Q720597) (← links)
• The Pfaffian sign theorem for the dimer model on a triangular lattice (Q721780) (← links)
• A Pfaffian formula for the monomer-dimer model on surface graphs (Q723656) (← links)
• Geometric representations of binary codes and computation of weight enumerators (Q984029) (← links)
• Pfaffian orientation and enumeration of perfect matchings for some Cartesian products of graphs (Q1028831) (← links)
• On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration (Q1277144) (← links)
• Matchings in graphs on non-orientable surfaces (Q1569077) (← links)
• Computation of sparse circulant permanents via determinants (Q1855364) (← links)
• On the matching and permanental polynomials of graphs (Q2043349) (← links)
• Counting the number of perfect matchings, and generalized decision trees (Q2044128) (← links)
• Drawing 4-Pfaffian graphs on the torus (Q2149490) (← links)
• The free-fermion eight-vertex model: couplings, bipartite dimers and \(Z\)-invariance (Q2223720) (← links)
• Variances and determinantal profiles of orientations (Q2250768) (← links)
• Characterizing Valiant's algebraic complexity classes (Q2479314) (← links)
• Geometric representations of linear codes (Q2517368) (← links)
• On the Pfaffian number of graphs (Q2840532) (← links)
• Identities between dimer partition functions on different surfaces (Q3302444) (← links)
• A property of the number of perfect matchings of a graph (Q3981016) (← links)
• Dimer model: Full asymptotic expansion of the partition function (Q4687686) (← links)
• The geometry of dimer models (Q5234869) (← links)
• Fermions and loops on graphs: II. A monomer–dimer model as a series of determinants (Q5239458) (← links)
• (Q5463581) (← links)
• A Pfaffian formula for the Ising partition function of surface graphs (Q5856867) (← links)
• Tractable minor-free generalization of planar zero-field Ising models (Q5857455) (← links)
• Perfect matchings, rank of connection tensors and graph homomorphisms (Q5886319) (← links)