𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Augmenting hypergraphs by edges of size two

✍ Scribed by Jorgen Bang-Jensen; Bill Jackson

Book ID
106276067
Publisher
Springer-Verlag
Year
1999
Tongue
English
Weight
120 KB
Volume
84
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Edge-augmentation of hypergraphs
Edge-augmentation of hypergraphs
✍ Eddie Cheng πŸ“‚ Article πŸ“… 1999 πŸ› Springer-Verlag 🌐 English βš– 175 KB
On the domination of hypergraphs by thei
On the domination of hypergraphs by their edges
✍ A. Behr; L. Camarinopoulos πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 395 KB

Given a hypergraph 9f=(E1,...,Er,) with vertex set V, let no be the number of different possibilities for coveting V by an odd number of E's and n~ the number of different possibilities for covering V when selecting an even number of E's. The quantity d(V, o~f)= no-nΒ’ is known as the (reliability) d

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