Improved Encoding and Counting of Uniform Hypertrees

Arjun Pitchanathan, Saswata Shannigrahi

We consider labeled $r$-uniform hypertrees having $n\ge r\ge 2$ vertices. The number of hyperedges in such a hypertree is $m=(n-1)/(r-1)$. We show that there are exactly $f…