Note on the Pfaffian matrix-tree theorem (Q1889842)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Note on the Pfaffian matrix-tree theorem |
scientific article; zbMATH DE number 2121771
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on the Pfaffian matrix-tree theorem |
scientific article; zbMATH DE number 2121771 |
Statements
Note on the Pfaffian matrix-tree theorem (English)
0 references
13 December 2004
0 references
The matrix-tree theorem gives a determinant counting spanning trees in a graph. An analogue of the matrix-tree theorem giving a Pfaffian that enumerates spanning trees in a 3-uniform hypergraph was proved by \textit{G. Masbaum} and \textit{A. Vaintrob} [Int Math. Res. Not. 27, 1397--1426 (2002; Zbl 1008.05100)]. In the present paper for this Pfaffian matrix-tree theorem a proof via sign-reversing involution is given.
0 references
matrix-tree theorem
0 references
Pfaffian
0 references
sign-reversing involution
0 references
