REVIEW 1 cited by
Graphical Condensation Generalizations Involving Pfaffians and Determinants
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Graphical condensation is a technique used to prove combinatorial identities among numbers of perfect matchings of plane graphs. Propp and Kuo first applied this technique to prove identities for bipartite graphs. Yan, Yeh, and Zhang later applied graphical condensation to nonbipartite graphs to prove more complex identities. Here we generalize some of the identities of Yan, Yeh, and Zhang. We also describe the latest generalization of graphical condensation in which the number of perfect matchings of a plane graph is expressed as a Pfaffian or a determinant where the entries are also numbers of perfect matchings of subgraphs.
Forward citations
Cited by 1 Pith paper
-
Newton polygons for the non-bipartite dimer model
Newton polygons and zig-zag path correspondences are extended from bipartite to non-bipartite dimer models on torus graphs, with real-rootedness proven for marginal polynomials of several graph families.
Discussion (0). Continue with ORCID to comment.