✦ LIBER ✦

Degrees and independent sets of hypergraphs

✍ Scribed by Pierre Hansen; Michel Lorea

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 464 KB
Volume: 14
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(76)90062-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Independent sets and repeated degrees

✍ B. Bollobás; A.D. Scott 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 316 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

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

Convex sets and hypergraphs

✍ M. D. Kovalev 📂 Article 📅 1991 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 257 KB

Supereulerian graphs, independent sets,

Supereulerian graphs, independent sets, and degree-sum conditions

✍ Zhi-Hong Chen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 573 KB

A graph is supereulerian if it contains a spanning closed trail. A graph G is collapsible if for every even subset R C V(G), there is a spanning connected subgraph of G whose set of odd degree vertices is R. The graph K1 is regarded as a trivial collapsible graph. A graph is reduced if it contains n

Lower bounds for constant degree indepen

Lower bounds for constant degree independent sets

✍ Michael O. Albertson; Debra L. Boutin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 340 KB

Let c(\* denote the maximum number of independent vertices all of which have the same degree. We provide lower bounds for G(\* for graphs that are planar, maximal planar, of bounded degree, or trees.