| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653678 | European Journal of Combinatorics | 2014 | 14 Pages |
Abstract
Our main result improves bounds of Markström and Ruciński on the minimum dd-degree which forces a perfect matching in a kk-uniform hypergraph on nn vertices. We also extend bounds of Bollobás, Daykin and Erdős by asymptotically determining the minimum vertex degree which forces a matching of size t
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Daniela Kühn, Deryk Osthus, Timothy Townsend,