𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nearly perfect matchings in regular simple hypergraphs

✍ Scribed by Noga Alon; Jeong-Han Kim; Joel Spencer

Book ID
110679420
Publisher
The Hebrew University Magnes Press
Year
1997
Tongue
English
Weight
643 KB
Volume
100
Category
Article
ISSN
0021-2172

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Perfect matchings in balanced hypergraph
Perfect matchings in balanced hypergraphs
✍ Michele Conforti; GΓ©rard CornuΓ©jols; Ajai Kapoor; Kristina VuΕ‘koviΔ‡ πŸ“‚ Article πŸ“… 1996 πŸ› Springer-Verlag 🌐 English βš– 202 KB
New bounds on nearly perfect matchings i
New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
✍ Van H. Vu πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 253 KB

Let H be a k + 1 -uniform, D-regular hypergraph on n vertices and let H be the minimum number of vertices left uncovered by a matching in H. C j H , the j-codegree of H, is the maximum number of edges sharing a set of j vertices in common. We prove a general upper bound on H , based on the codegree

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