Change search
ReferencesLink to record
Permanent link

Direct link
Around matrix-tree theorem
Independent University of Moscow.
Stockholm University, Faculty of Science, Department of Mathematics.
2006 (English)In: Mathematical Research Letters, ISSN 1073-2780, Math. Res. Lett., Vol. 13, no 5--6, 761-774 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
2006. Vol. 13, no 5--6, 761-774 p.
Keyword [en]
Tutte polynomial; matrix-tree theorem; subgraph count
National Category
URN: urn:nbn:se:su:diva-20603OAI: diva2:187129
Available from: 2010-12-31 Created: 2007-11-28 Last updated: 2011-06-20Bibliographically approved

Open Access in DiVA

fulltext(226 kB)53 downloads
File information
File name FULLTEXT01.pdfFile size 226 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Search in DiVA

By author/editor
Shapiro, Boris
By organisation
Department of Mathematics
In the same journal
Mathematical Research Letters

Search outside of DiVA

GoogleGoogle Scholar
Total: 53 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 36 hits
ReferencesLink to record
Permanent link

Direct link