๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A lower bound for the independence number of a planar graph

โœ Scribed by Michael O Albertson

Publisher
Elsevier Science
Year
1976
Tongue
English
Weight
403 KB
Volume
20
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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 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 for the circumference of a
A lower bound for the circumference of a graph
โœ Nathan Linial ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 423 KB

Lrzt G = (V, 0 be a ttlock :.>f order n, different from Kn. Let ~FI = min {d(x) + d(y): n then G contains a cycle of length at least m. 1. Introductlion and notatio e discuss only finite undirected graphs withsLc loops and multiple edges. We p:rosye the main theorem d show how Qre's th -orem [ 3.1 o