Forestation in hypergraphs: Linear \(k\)-trees (Q1408553)

Summary: We present a new proof of a result of Lová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\).