A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Around matrix-tree theorem
[article]
2006
arXiv
pre-print
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system D_n (the classical theorem corresponds to the A_n-case). Several byproducts of the developed technique, such as a new formula for a specialization of the multivariate Tutte polynomial, are of independent interest.
arXiv:math/0512164v2
fatcat:2u5ep3lrljfmvf4iz2z6bg62fm