The independence number of dense graphs with large odd girth (Q1344960)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 725317
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
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
0.8915516138076782
0 references
0.8907346725463867
0 references
0.8145179748535156
0 references
0.8079065084457397
0 references
0.8046294450759888
0 references
