✦ LIBER ✦

On the Fractional Covering Number of Hypergraphs

✍ Scribed by Chung, F. R. K.; Füredi, Z.; Garey, M. R.; Graham, R. L.

Book ID: 118196866
Publisher: Society for Industrial and Applied Mathematics
Year: 1988
Tongue: English
Weight: 532 KB
Volume: 1
Category: Article
ISSN: 0895-4801
DOI: 10.1137/0401005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounding the vertex cover number of a hy

Bounding the vertex cover number of a hypergraph

✍ Guo-Li Ding; Paul Seymour; Peter Winkler 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 539 KB

Chromatic numbers of hypergraphs and cov

Chromatic numbers of hypergraphs and coverings of graphs

✍ Zevi Miller; Heinrich Müller 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 284 KB

Burr recently proved [3] that for positive integers m , , m 2 , . . , , m, and any graph G we have x(G) 5 &, if and only if G can be expressed as the edge disjoint union of subgraphs F, satisfying x(F,) 5 m,. This theorem is generalized to hypergraphs. By suitable interpretations the generalization

The covering problem of complete uniform

The covering problem of complete uniform hypergraphs

✍ Marc Snir 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 248 KB

On special numberings of hypergraphs

✍ Günter Schaar 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 83 KB

On The Chromatic Number of Geometric Hyp

On The Chromatic Number of Geometric Hypergraphs

✍ Smorodinsky, Shakhar 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 184 KB

Fractional v. Integral Covers in Hypergr

Fractional v. Integral Covers in Hypergraphs of Bounded Edge Size

✍ Jeff Kahn; P.Mark Kayll 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 470 KB

In the early 1980's, V. Ro dl proved the Erdo s Hanani Conjecture, sparking a remarkable sequence of developments in the theory of packing and covering in hypergraphs of bounded edge size. Generalizations were given by P. Frankl and Ro dl, by N. Pippenger, and by others. In each case, an appropriate