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

New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs

โœ Scribed by Dutta, Kunal; Mubayi, Dhruv; Subramanian, C. R.

Book ID
118197175
Publisher
Society for Industrial and Applied Mathematics
Year
2012
Tongue
English
Weight
212 KB
Volume
26
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

New Lower Bounds for Ramsey Numbers of G
New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs
โœ Felix Lazebnik; Dhruv Mubayi ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 146 KB ๐Ÿ‘ 1 views

## dedicated to the memory of rodica simion Let G be an r-uniform hypergraph. The multicolor Ramsey number r k G is the minimum n such that every k-coloring of the edges of the complete r-uniform hypergraph K r n yields a monochromatic copy of G. Improving slightly upon results from M. Axenovich,

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.