| Full text | |
| Author(s): |
Total Authors: 4
|
| Affiliation: | [1] Univ Hamburg, Fachbereich Math, Hamburg - Germany
[2] Univ Rhode Isl, Dept Math, 5 Lippitt Rd, Kingston, RI 02881 - USA
[3] Univ Sao Paulo, Inst Matemat & Estat, Sao Paulo - Brazil
[4] Univ Fed ABC, Ctr Matemat Comp & Cognicao, Santo Andre - Brazil
Total Affiliations: 4
|
| Document type: | Journal article |
| Source: | RANDOM STRUCTURES & ALGORITHMS; v. 55, n. 4 JULY 2019. |
| Web of Science Citations: | 2 |
| Abstract | |
For k >= 2 and r >= 1 such that k + r >= 4, we prove that, for any alpha > 0, there exists epsilon > 0 such that the union of an n-vertex k-graph with minimum codegree mml:mfenced close={''}){''} open={''}({''} separators={''}{''}1-mml:mfenced close={''}){''} open={''}({''} separators={''}{''}>k+r-2k-1-1+alpha n and a binomial random k-graph G(k)(n,p) with p >= n-mml:mfenced close={''}){''} open={''}({''} separators={''}{''}>k+r-2k-1-1-epsilon on the same vertex set contains the rth power of a tight Hamilton cycle with high probability. This result for r = 1 was first proved by McDowell and Mycroft. (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: | 13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science |
| Grantee: | Carlos Eduardo Ferreira |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 18/04876-1 - Ramsey theory, structural graph theory and applications in Bioinformatics |
| Grantee: | Guilherme Oliveira Mota |
| Support Opportunities: | Research Grants - Young Investigators Grants |