A lower bound on independence in terms of degrees
type: Item
instance of: scholarly article
title: A lower bound on independence in terms of degrees
zbMATH Open document ID: 1218.05036
author: Jochen Harant
published in: Discrete Applied Mathematics
publication date: 2011-06-28T00:00:00Z
full work available at URL: IfM Preprint M10 08.pdf
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5914054
zbMATH Keywords: independence
zbMATH Keywords: stability
zbMATH Keywords: connected graph
MaRDI profile type: Publication
OpenAlex ID: W2020061266
cites work: Independence in connected graphs
cites work: On the independence number of a graph in terms of order and size
cites work: A lower bound on the independence number of a graph in terms of degrees
cites work: Clique is hard to approximate within \(n^{1-\epsilon}\)
cites work: Foreword: Special issue on stability in graphs and related topics
DOI: 10.1016/J.DAM.2011.03.003
description: scientific article; zbMATH DE number 5914054