# On Selkow’s Bound on the Independence Number of Graphs

@article{Harant2019OnSB,
title={On Selkow’s Bound on the Independence Number of Graphs},
author={Jochen Harant and Samuel Mohr},
journal={Discussiones Mathematicae Graph Theory},
year={2019},
volume={39},
pages={655 - 657}
}
• Published 9 May 2017
• Mathematics
• Discussiones Mathematicae Graph Theory
Abstract For a graph G with vertex set V (G) and independence number α(G), Selkow [A Probabilistic lower bound on the independence number of graphs, Discrete Math. 132 (1994) 363–365] established the famous lower bound ∑v∈V(G)1d(v)+1(1+max{d(v)d(v)+1-∑u∈N(v)1d(u)+1,0}) $\sum {_{v \in V(G)}{1 \over {d(v) + 1}}} \left( {1 + \max \left\{ {{{d(v)} \over {d(v) + 1}} - \sum {_{u \in N(v)}{1 \over {d(u) + 1}},0} } \right\}} \right)$ on α (G), where N(v) and d(v) = |N(v)| denote the neighborhood and…
4 Citations
On the extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives
• Mathematics
• 2018
The famous lower bound $\alpha(G)\geq \sum_{u\in V(G)}\frac{1}{d_G(u)+1}$ on the independence number $\alpha(G)$ of a graph $G$ due to Caro and Wei is known to be tight if and only if the components
Cliques, Degrees, and Coloring: Expanding the ω, Δ, χ paradigm
Many of the most celebrated and influential results in graph coloring, such as Brooks’ Theorem and Vizing’s Theorem, relate a graph’s chromatic number to its clique number or maximum degree.
New Bounds on Domination and Independence in Graphs1
• Computer Science
Discussiones Mathematicae Graph Theory
• 2021
New bounds on the domination number and on the independence number of a graph are proposed using the Bhatia-Davis inequality linking the variance, the expected value, the minimum, and the maximum of a random variable with bounded distribution.

## References

SHOWING 1-5 OF 5 REFERENCES
The Probabilistic Method
• Computer Science
SODA
• 1992
A particular set of problems - all dealing with “good” colorings of an underlying set of points relative to a given family of sets - is explored.
A Lower Bound on the Stability Number of a Simple Graph (Technical Memorandum
• Bell laboratories,
• 1981
A Lower Bound on the Stability Number of a Simple Graph
• Technical memorandum, TM 81 - 11217 - 9, Bell laboratories
• 1981
New Results on the Independence Number
• Technical Report, Tel-Aviv University
• 1979