𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The lower bound on independence number

✍ Scribed by Yusheng Li; Cecil C. Rousseau; Wen’an Zang

Book ID
111783764
Publisher
SP Science China Press
Year
2002
Tongue
English
Weight
323 KB
Volume
45
Category
Article
ISSN
1674-7283

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 arbitrary hypergraphs
✍ Thiele, Torsten 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB 👁 3 views

We present a lower bound on the independence number of arbitrary hypergraphs in terms of the degree vectors. The degree vector of a vertex v is given by d is the number of edges of size m containing v. We define a function f with the property that any hypergraph H = (V, E) satisfies α(H) ≥ v∈V f (d

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.

A Lower Bound on Unknotting Number*
A Lower Bound on Unknotting Number*
✍ Jiming Ma; Ruifeng Qiu 📂 Article 📅 2006 🏛 Coastal and Estuarine Research Federation 🌐 English ⚖ 141 KB