| Full text | |
| Author(s): |
Han, Jie
Total Authors: 1
|
| Document type: | Journal article |
| Source: | SIAM JOURNAL ON DISCRETE MATHEMATICS; v. 30, n. 3, p. 1351-1357, 2016. |
| Web of Science Citations: | 7 |
| Abstract | |
We prove a new upper bound for the minimum d-degree threshold for perfect matchings in k-uniform hypergraphs when d < k/2. As a consequence, this determines exact values of the threshold when 0.42k <= d < k/2 or when (k, d) = (12, 5) or (17, 7). Our approach is to give an upper bound on the Erdos matching conjecture and convert the result to the minimum d-degree setting using an approach of Kuhn, Osthus, and Townsend. To obtain exact thresholds, we also apply a result of Treglown and Zhao. (AU) | |
| FAPESP's process: | 14/18641-5 - Hamilton cycles and tiling problems in hypergraphs |
| Grantee: | Jie Han |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| FAPESP's process: | 15/07869-8 - Perfect matchings and Tilings in hypergraphs |
| Grantee: | Jie Han |
| Support Opportunities: | Scholarships abroad - Research Internship - Post-doctor |