Around matrix-tree theorem
| dc.creator | Burman, Yurii | |
| dc.creator | Shapiro, Boris | |
| dc.date | 2005-12-07 | |
| dc.date | 2006-02-12 | |
| dc.date.accessioned | 2026-07-07T06:54:58Z | |
| dc.date.available | 2026-07-07T06:54:58Z | |
| dc.description | 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. | |
| dc.description | 13 pages, no figures | |
| dc.identifier | https://arxiv.org/abs/math/0512164 | |
| dc.identifier | http://arxiv.org/abs/math/0512164 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/106133 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C50 (Primary), 05B35 (Secondary) | |
| dc.title | Around matrix-tree theorem | |
| dc.type | text |