𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree

✍ Scribed by Hàn, Hip; Person, Yury; Schacht, Mathias


Book ID
118197042
Publisher
Society for Industrial and Applied Mathematics
Year
2009
Tongue
English
Weight
259 KB
Volume
23
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Matchings in hypergraphs of large minimu
✍ Daniela Kühn; Deryk Osthus 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

## Abstract It is well known that every bipartite graph with vertex classes of size __n__ whose minimum degree is at least __n__/2 contains a perfect matching. We prove an analog of this result for hypergraphs. We also prove several related results that guarantee the existence of almost perfect mat