𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Weighted fractional and integral k-matching in hypergraphs

✍ Scribed by Anand Srivastav; Peter Stangier

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
712 KB
Volume
57
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Perfect fractional matchings in random h
Perfect fractional matchings in random hypergraphs
✍ Michael Krivelevich πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 890 KB

Given an r-uniform hypergraph H = (V, E ) on ( V ( = n vertices, a real-valued function f(e) 5 1 for all u E V and C e E E f(e) = n/r. Considering a random r-uniform hypergraph process of n vertices, we show that with probability tending to 1 as n + m , at the very moment to when the last isolated

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

Partial Steiner systems and matchings in
Partial Steiner systems and matchings in hypergraphs
✍ A.V. Kostochka; V. RΓΆdl πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 203 KB

For tk, a t, k T-system is a k-uniform hypergraph H such that any two Ε½ . distinct edges of H have at most t y 1 vertices in common. Clearly, any t, k -system on n n k