Factorizations of some weighted spanning tree enumerators
组合数学
2007-05-23 v2
摘要
We give factorizations for weighted spanning tree enumerators of Cartesian products of complete graphs, keeping track of fine weights related to degree sequences and edge directions. Our methods combine Kirchhoff's Matrix-Tree Theorem with the technique of identification of factors.
引用
@article{arxiv.math/0302213,
title = {Factorizations of some weighted spanning tree enumerators},
author = {Jeremy L. Martin and Victor Reiner},
journal= {arXiv preprint arXiv:math/0302213},
year = {2007}
}
备注
Final version, 12 pages. To appear in the Journal of Combinatorial Theory, Series A. The paper has been reorganized, and the proof of Theorem 4 shortened, in light of a more general result appearing in reference [6]