Quasi-random hypergraphs and spanning subhypergraph containment
A Multiscale Framework Applied to the Investigation of CO2 Reduction on Metallic N...
The Asymptotic Combinatorics of Permutations and Flag Algebras
| Full text | |
| Author(s): |
Han, Jie
;
Zhao, Yi
Total Authors: 2
|
| Document type: | Journal article |
| Source: | JOURNAL OF COMBINATORIAL THEORY SERIES A; v. 143, p. 107-115, OCT 2016. |
| Web of Science Citations: | 0 |
| Abstract | |
For 1 <= d <= l < k, we give a new lower bound for the minimum d-degree threshold that guarantees a Hamilton l-cycle in k-uniform hypergraphs. When k >= 4 and d < l = k - 1, this bound is larger than the conjectured minimum d-degree threshold for perfect matchings and thus disproves a well-known conjecture of Rodl and Rucinski. Our (simple) construction generalizes a construction of Katona and Kierstead and the space barrier for Hamilton cycles. (C) 2016 Elsevier Inc. All rights reserved. (AU) | |
| FAPESP's process: | 15/07869-8 - Perfect matchings and Tilings in hypergraphs |
| Grantee: | Jie Han |
| Support Opportunities: | Scholarships abroad - Research Internship - Post-doctor |
| FAPESP's process: | 14/18641-5 - Hamilton cycles and tiling problems in hypergraphs |
| Grantee: | Jie Han |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |