The independence number of dense graphs with large odd girth (Q1344960): Difference between revisions
From MaRDI portal
Created a new Item |
Import IPFS CIDs |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / IPFS content identifier | |||
Property / IPFS content identifier: bafkreig3xg3d3h2nw2yfwfuvglqrphetszjep47k4dtk5aafjfp52cgvry / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:15, 22 February 2025
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
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