𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Coverings and matchings in r-partite hypergraphs

✍ Scribed by Douglas S. Altner; J. Paul Brooks

Book ID
112163189
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
332 KB
Volume
59
Category
Article
ISSN
0028-3045

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

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