The independence number of dense graphs with large odd girth (Q1344960)

From MaRDI portal





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

    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