Factorizations of some weighted spanning tree enumerators

Simple item page
dc.creatorMartin, Jeremy L.
dc.creatorReiner, Victor
dc.date2003-02-18
dc.date2003-09-02
dc.date.accessioned2026-07-07T04:55:23Z
dc.date.available2026-07-07T04:55:23Z
dc.descriptionWe 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.
dc.descriptionFinal 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]
dc.identifierhttps://arxiv.org/abs/math/0302213
dc.identifierhttp://arxiv.org/abs/math/0302213
dc.identifierJ. Combin. Theory Ser. A 104, no. 2 (2003), pp. 287--300.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/66559
dc.subjectCombinatorics
dc.subject05C05 (Primary)
dc.titleFactorizations of some weighted spanning tree enumerators
dc.typetext

Files

Collections

arXiv