Factorizations of some weighted spanning tree enumerators

Martin, Jeremy L.; Reiner, Victor

View/Open

spantree.pdf (384.7Kb)

Issue Date

2003-11

Author

Martin, Jeremy L.

Reiner, Victor

Publisher

Elsevier

Type

Article

Article Version

Scholarly/refereed, author accepted manuscript

Version

http://arxiv.org/abs/math.CO/0302213

Metadata

Show full item record

Abstract

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.

Description

This is the author's accepted manuscript.

Citation

Factorizations of some weighted spanning tree enumerators (with Victor Reiner), Journal of Combinatorial Theory, Series A 104, no. 2 (2003), 287--300.

The University of Kansas prohibits discrimination on the basis of race, color, ethnicity, religion, sex, national origin, age, ancestry, disability, status as a veteran, sexual orientation, marital status, parental status, gender identity, gender expression and genetic information in the University’s programs and activities. The following person has been designated to handle inquiries regarding the non-discrimination policies: Director of the Office of Institutional Opportunity and Access, IOA@ku.edu, 1246 W. Campus Road, Room 153A, Lawrence, KS, 66045, (785)864-6414, 711 TTY.