Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) (Q345121)
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: Decomposition of sparse graphs into forests: the nine dragon tree conjecture for k 2 |
scientific article; zbMATH DE number 6656188
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) |
scientific article; zbMATH DE number 6656188 |
Statements
Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) (English)
0 references
25 November 2016
0 references
nine dragon tree conjecture
0 references
arboricity
0 references
Nash-Williams arboricity formula
0 references
fractional arboricity
0 references
forest
0 references
graph decomposition
0 references
discharging method
0 references
sparse graph
0 references
0 references
0.9584228992462158
0 references
0.9359320998191832
0 references
0.914600670337677
0 references
0.8729580044746399
0 references
0.8583609461784363
0 references
