✦ LIBER ✦

Hypergraphs with independent neighborhoods

✍ Scribed by Tom Bohman; Alan Frieze; Dhruv Mubayi; Oleg Pikhurko

Publisher: Springer-Verlag
Year: 2010
Tongue: English
Weight: 529 KB
Volume: 30
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-010-2474-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Neighborhood hypergraphs of bipartite gr

Neighborhood hypergraphs of bipartite graphs

✍ Endre Boros; Vladimir Gurvich; Igor Zverovich 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB

## Abstract Matrix symmetrization and several related problems have an extensive literature, with a recurring ambiguity regarding their complexity and relation to graph isomorphism. We present a short survey of these problems to clarify their status. In particular, we recall results from the litera

Independence in hypergraphs

✍ Yu. A. Sushkov 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 445 KB

Degrees and independent sets of hypergra

Degrees and independent sets of hypergraphs

✍ Pierre Hansen; Michel Lorea 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 464 KB

Maximal matchings in graphs with large n

Maximal matchings in graphs with large neighborhoods of independent vertices

✍ I. Rinsma; C. H. C. Little; D. R. Woodall 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB

## Abstract We obtain lower bounds on the size of a maximum matching in a graph satisfying the condition |__N(X)__| ≥ __s__ for every independent set __X__ of __m__ vertices, thus generalizing results of Faudree, Gould, Jacobson, and Schelp for the case __m__ = 2.

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

Derandomizing Chebyshev's inequality to

Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs

✍ Andrés D. Fundia 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 817 KB

In [l] it is proved that an uncrowded (k + 1)-hypergraph of average degree t" contains an independent set of size (cnlt)(ln t ) ' l k . We present a polynomial time algorithm that finds such an independent set by derandomizing the original probabilistic proof. The technique that we use can be applie