Mathematics – Combinatorics
Scientific paper
2005-12-07
Mathematics
Combinatorics
13 pages, no figures
Scientific paper
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.
Burman Yurii
Shapiro Boris
No associations
LandOfFree
Around matrix-tree theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Around matrix-tree theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Around matrix-tree theorem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-443190