Forestation in hypergraphs: Linear \(k\)-trees (Q1408553)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Forestation in hypergraphs: Linear \(k\)-trees |
scientific article; zbMATH DE number 1985387
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Forestation in hypergraphs: Linear \(k\)-trees |
scientific article; zbMATH DE number 1985387 |
Statements
Forestation in hypergraphs: Linear \(k\)-trees (English)
0 references
24 September 2003
0 references
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\).
0 references
