Around matrix-tree theorem

From MaRDI portal




Abstract: 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 Dn (the classical theorem corresponds to the An-case). Several byproducts of the developed technique, such as a new formula for a specialization of the multivariate Tutte polynomial, are of independent interest.









This page was built for publication: Around matrix-tree theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862053)