The number of labeled k-dimensional trees

Abstract

The graphs known as trees have natural analogues in higher dimensional simplicial complexes. As an extension of Cayley's formula n n−2 , the number of these k-dimensional trees on n-labeled vertices is shown to be ( n k ) ( kn−k 2+1) n−k−2 .