author={Caroline J. Klivans and Jeremy L. Martin},
We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes ∆, extending an idea due to G. Kalai. We prove a simplicial version of the Matrix-Tree Theorem that counts simplicial spanning trees, weighted by the squares of the orders of their top-dimensional integral homology groups, in terms of the Laplacian matrix of ∆. As in the graphic case, one can obtain a more finely weighted generating function for… CONTINUE READING
Highly Cited
This paper has 73 citations. REVIEW CITATIONS


Publications citing this paper.

74 Citations

Citations per Year
Semantic Scholar estimates that this publication has 74 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 51 references

An extended Euler-Poincaré theorem

Anders Björner, Gil Kalai
Acta Math. 161, • 1988
View 18 Excerpts
Highly Influenced

Enumeration of Q-acyclic simplicial complexes, Israel

Gil Kalai
J. Math. 45, • 1983
View 18 Excerpts
Highly Influenced

Counting colorful multi-dimensional trees

Combinatorica • 1992
View 11 Excerpts
Highly Influenced

Hoşten, Cyclotomic polytopes and growth series of cyclotomic lattices

Matthias Beck, Serkan
Math. Res. Lett. 13, • 2006
View 1 Excerpt

Obstructions to Shiftedness

Discrete & Computational Geometry • 2005