Note on the Pfaffian matrix-tree theorem (Q1889842)

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.