The independence number of dense graphs with large odd girth (Q1344960): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import240304020342 (talk | contribs)
Set profile property.
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 04:01, 5 March 2024

scientific article
Language Label Description Also known as
English
The independence number of dense graphs with large odd girth
scientific article

    Statements

    The independence number of dense graphs with large odd girth (English)
    0 references
    0 references
    21 February 1995
    0 references
    Summary: Let \(G\) be a graph with \(n\) vertices and odd girth \(2k + 3\). Let the degree of a vertex \(v\) of \(G\) be \(d_ 1 (v)\). Let \(\alpha (G)\) be the independence number of \(G\). Then we show \[ \alpha(G) \geq 2^{-\left( \frac {k-1}{k} \right)} \left[\displaystyle {\sum_{v \in G}}d_ 1 (v)^{\frac{1}{k - 1}} \right]^{(k - 1)/k}. \] This improves and simplifies results proven by Denley.
    0 references
    dense graphs
    0 references
    odd girth
    0 references
    independence number
    0 references

    Identifiers