Induced forests in cubic graphs
type: Item
instance of: scholarly article
title: Induced forests in cubic graphs
zbMATH Open document ID: 0536.05015
DOI: 10.1016/0012-365X(84)90115-8
author: William Staton
published in: Discrete Mathematics
publication date: 1984-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 3851113
zbMATH Keywords: cubic graph
zbMATH Keywords: girth
zbMATH Keywords: forest
zbMATH Keywords: independence ratio
reviewed by: Peter Horák
MaRDI profile type: Publication
cites work: On the independence ratio of a graph
cites work: The Independence Ratio of Regular Graphs
cites work: The point-arboricity of a graph
cites work: Girth and Independence Ratio
cites work: Q4063170
cites work: Q4073393
description: scientific article; zbMATH DE number 3851113