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

Independence in hypergraphs

โœ Scribed by Yu. A. Sushkov

Publisher
Springer US
Year
1984
Tongue
English
Weight
445 KB
Volume
27
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Hypergraphs with independent neighborhoo
Hypergraphs with independent neighborhoods
โœ Tom Bohman; Alan Frieze; Dhruv Mubayi; Oleg Pikhurko ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 529 KB
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

Approximating Coloring and Maximum Indep
Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs
โœ Michael Krivelevich; Ram Nathaniel; Benny Sudakov ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 120 KB

We discuss approximation algorithms for the coloring problem and the maximum independent set problem in 3-uniform hypergraphs. An algorithm for coloring หœ1r5 ลฝ . ## 3-uniform 2-colorable hypergraphs in O n colors is presented, improving previously known results. Also, for every fixed โฅ ) 1r2, we