2 citations · 2 across the 1 of their papers we have counts for
1 paper
Andrew Goodall, Anna de Mier
Masbaum and Vaintrob's "Pfaffian matrix tree theorem" implies that counting spanning trees of a 3-uniform hypergraph (abbreviated to 3-graph) can be done in polynomial time for a c…