1 paper
Nathan Linial, Roy Meshulam, Mishael Rosenthal
A k-dimensional hypertree X is a k-dimensional complex on n vertices with a full (k-1)-dimensional skeleton and \binom{n-1}{k} facets such that H_k(X;Q)=0. Here we introduce the fo…