𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a lower bound for the connectivity of the independence complex of a graph

✍ Scribed by Michał Adamaszek; Jonathan Ariel Barmak

Book ID
113567349
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
187 KB
Volume
311
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound on the independence number
A lower bound on the independence number of a graph
✍ Jochen Harant 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 210 KB

A new lower bound on the independence number of a graph is established and an accompanying efficient algorithm constructing an independent vertex set the cardinality of which is at least this lower bound is given. (~

A Probabilistic lower bound on the indep
A Probabilistic lower bound on the independence number of graphs
✍ Stanley M. Selkow 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 124 KB

Caro (1979) and Wei (1981) established a bound on the size of an independent set of a graph as a function of its degrees. In case the degrees of each vertex's neighbors are also known, we establish a lower bound which is tighter for most graphs.