Induced forests in cubic graphs (Q791532): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q215558
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Peter Horák / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence ratio of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Independence Ratio of Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The point-arboricity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Girth and Independence Ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4073393 / rank
 
Normal rank

Latest revision as of 11:24, 14 June 2024

scientific article
Language Label Description Also known as
English
Induced forests in cubic graphs
scientific article

    Statements

    Induced forests in cubic graphs (English)
    0 references
    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 references

    Identifiers