Forestation in hypergraphs: Linear \(k\)-trees (Q1408553): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:30, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Forestation in hypergraphs: Linear \(k\)-trees |
scientific article |
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
