arXiv · math/0605154
Graphical Condensation Generalizations Involving Pfaffians and Determinants
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Eric Kuo. 2006-05-05. Graphical Condensation Generalizations Involving Pfaffians and Determinants. https://searcharxiv.com/abs/math/0605154
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.