\magnification=1200
\hsize=4in
\overfullrule=0pt
\nopagenumbers
\noindent
%
%
{\bf Ojas Parekh}
%
%
\medskip
\noindent
%
%
{\bf Forestation in Hypergraphs: Linear $k$-Trees}
%
%
\vskip 5mm
\noindent
%
%
%
%
We present a new proof of a result of Lov\'{a}sz on the maximum number
of edges in a $k$-forest.  We also apply a construction used in our
proof to generalize the notions of a $k$-hypertree and $k$-forest to a
class which extends some properties of trees, to which both specialize
when $k=2$.

\bye

.
