✦ LIBER ✦

On independent sets in hypergraphs

✍ Scribed by Alexandr Kostochka; Dhruv Mubayi; Jacques Verstraëte

Book ID: 112187430
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 154 KB
Volume: 44
Category: Article
ISSN: 1042-9832
DOI: 10.1002/rsa.20453

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower Bounds on the Size of Maximum Inde

Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three

✍ Michael A. Henning; Anders Yeo 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 745 KB

Extending the Balas-Yu bounds on the num

Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices

✍ Endre Boros; Khaled Elbassioni; Vladimir Gurvich; Leonid Khachiyan 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 191 KB

Degrees and independent sets of hypergra

Degrees and independent sets of hypergraphs

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

Finding Large Independent Sets in Graphs

Finding Large Independent Sets in Graphs and Hypergraphs

✍ Shachnai, Hadas; Srinivasan, Aravind 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 179 KB

Differential Methods for Finding Indepen

Differential Methods for Finding Independent Sets in Hypergraphs

✍ Li, Yusheng; Zang, Wenan 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 151 KB

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