Calculation of Pfaffians by a Chip Removal
- 19 Downloads
We describe a new combinatorial-algebraic transformation on graphs which we call “chip removal.” It generalizes the well-known Urban Renewal trick of Propp and Kuperberg. The chip removal is useful in calculations of determinants of adjacency matrices and matching numbers of graphs. A beautiful example of this technique is a theorem on removing four-contact chips, which generalizes Kuo’s graphical condensation method. Numerous examples are given. Bibliography: 10 titles.
KeywordsWhite Vertex External Edge Matching Number Chip Removal External Vertex
Unable to display preview. Download preview PDF.
- 3.L. Lovasz and M. D. Plummer, Matching Theory, Elsevier (1986).Google Scholar
- 5.T. Došlić, “Perfect matchings in lattice animals and lattice paths with constraints,” Croatia Chemica Acta, 78, No. 2, 251–259 (2005).Google Scholar
- 6.M. Fulmek, “Graphical condensation, overlapping Pfaffians and superpositions of matchings,” Electron J. Combin., 17, No. 1, Research Paper 83 (2010).Google Scholar
- 7.R. Kenyon, “Local statistics of lattice dimers,” Ann. Inst. Poincar´e Probab. Statist., 33, No. 5, 591–618 (1997).Google Scholar
- 8.P. H. Lundow, “Enumeration of matchings in polygraphs,” Research report, Umea University (1988).Google Scholar
- 9.J. A. Sellers, “Domino tilings and products of Fibonacci and Pell numbers,” J. Integer Seq., 5, Article 02.1.2 (2002).Google Scholar