中文

Around matrix-tree theorem

组合数学 2007-05-23 v2

摘要

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 DnD_n (the classical theorem corresponds to the AnA_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.

关键词

引用

@article{arxiv.math/0512164,
  title  = {Around matrix-tree theorem},
  author = {Yurii Burman and Boris Shapiro},
  journal= {arXiv preprint arXiv:math/0512164},
  year   = {2007}
}

备注

13 pages, no figures