𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Matchings in 3-uniform hypergraphs of large minimum vertex degree

✍ Scribed by Andrew Treglown; Daniela Kühn; Deryk Osthus


Book ID
119236653
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
195 KB
Volume
38
Category
Article
ISSN
1571-0653

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