Induced forests in cubic graphs (Q791532)
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: Induced forests in cubic graphs |
scientific article; zbMATH DE number 3851113
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Induced forests in cubic graphs |
scientific article; zbMATH DE number 3851113 |
Statements
Induced forests in cubic graphs (English)
0 references
1984
0 references
Let G be a graph with vertex set V(G). Denote \(f(G)=\max \quad \{| A| /| V(G)|;A\subset V(G),\) A induces a fores\(t\}\). The author derives bounds on f(G) and consequently calculates that lim \(\inf_{n\to \infty}\{f(G)\); G is a cubic graph with girth at least \(n\}\) equals to 3/4.
0 references
cubic graph
0 references
girth
0 references
forest
0 references
independence ratio
0 references
0.8936383128166199
0 references
0.8504542112350464
0 references
0.8474637269973755
0 references
0.8289271593093872
0 references
0.8000008463859558
0 references
