Graphical Condensation Generalizations Involving Pfaffians and Determinants

Details Graphical Condensation Generalizations Involving Pfaffians and Determinants Graphical Condensation Generalizations Involving Pfaffians and Determinants

2006-05-05

arxiv.org/abs/math/0605154v1

Mathematics

Combinatorics

12 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Graphical Condensation Generalizations Involving Pfaffians and Determinants does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graphical Condensation Generalizations Involving Pfaffians and Determinants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graphical Condensation Generalizations Involving Pfaffians and Determinants will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-607970