Note: A new lower bound on the independence number of graphs

Authors:
Eric Angel;Romain Campigotto;Christian Laforest
Affiliations:
Laboratoire IBISC, EA 4526-Université d'ívry-Val d'Essonne, IBGBI, 23 boulevard de France, 91037 ívry Cedex, France;LAMSADE, CNRS UMR 7243-Université Paris-Dauphine, place du Maréchal de Lattre de Tassigny, 75775 Paris Cedex 16, France;LIMOS, CNRS UMR 6158-Université Blaise Pascal, Clermont-Ferrand, Campus des Cézeaux, 24 avenue des Landais, 63173 Aubière Cedex, France
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 6
Cited 0

A probabilistic lower bound on the independence number of graphs

Discrete Mathematics
Clique is hard to approximate within n1-

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Foreword: special issue on stability in graphs and related topics

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
On the independence number of the Erdős-Rényi and projective norm graphs and a related hypergraph

Journal of Graph Theory
A lower bound on independence in terms of degrees

Discrete Applied Mathematics
Implementation and comparison of heuristics for the vertex cover problem on huge graphs

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms

Quantified Score

Hi-index	0.04

Visualization

Abstract

We propose a new lower bound on the independence number of a graph. We show that our bound compares favorably to recent ones (e.g. Harant (2011) [12]). We obtain our bound by using the Bhatia-Davis inequality applied with analytical results (minimum, maximum, expectation and variance) of an algorithm for the vertex coverproblem.