On Selkow's bound on the independence number of graphs

DOI10.7151/dmgt.2100zbMath1411.05202arXiv1705.03779OpenAlexW2613223953WikidataQ129782089 ScholiaQ129782089MaRDI QIDQ2416950

Samuel Mohr, Jochen Harant

Publication date: 27 May 2019

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.03779

zbMATH Keywords

independence number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives

Cites Work

• A probabilistic lower bound on the independence number of graphs
• Unnamed Item

This page was built for publication: On Selkow's bound on the independence number of graphs