\input zb-basic
\input zb-ioport
\iteman{io-port 05733412}
\itemau{Liu, Muhuo; Liu, Bolian}
\itemti{The counting of uniform acyclic hypergraphs.}
\itemso{J. Syst. Sci. Math. Sci. 29, No. 8, 1028-1033 (2009).}
\itemab
Summary: In this paper, the recursion formulas for $r$-uniform $ (d)$-hyperforests and $r$-uniform $ (d)$-real hyperforests with $n$ labeled vertices are presented, and the explicit formulas are obtained for forests with $n$ labeled vertices having isolated vertices or none.
\itemrv{~}
\itemcc{}
\itemut{uniform hypergraph; hypertree; hyperforests}
\itemli{}
\end