Oops; meant to send this to a different email address. Please ignore. Jim On Thu, Jul 30, 2015 at 2:02 PM, James Propp <jamespropp@gmail.com> wrote:

Can someone give me a reference to the result of Kalai and Linial (?) generalizing Cayley's formula to spanning "trees" in hypergraphs?

I mean the result in which the right-hand-side is something like n to the power of n-choose-k, counting generalized spanning trees of the complete k-hypergraph on n vertices.

Thanks,

Jim Propp