𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Perfect Matchings in Balanced Hypergraphs – A Combinatorial Approach

✍ Scribed by Andreas Huck; Eberhard Triesch

Book ID
106167943
Publisher
Springer-Verlag
Year
2002
Tongue
English
Weight
155 KB
Volume
22
Category
Article
ISSN
0209-9683

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
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

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