| Texto completo | |
| Autor(es): |
Número total de Autores: 2
|
| Afiliação do(s) autor(es): | [1] Univ Rhode Isl, Dept Math, 5 Lippitt Rd, Kingston, RI 02881 - USA
[2] Georgia State Univ, Dept Math & Stat, Atlanta, GA 30303 - USA
Número total de Afiliações: 2
|
| Tipo de documento: | Artigo Científico |
| Fonte: | JOURNAL OF COMBINATORIAL THEORY SERIES B; v. 144, p. 14-31, SEP 2020. |
| Citações Web of Science: | 0 |
| Resumo | |
For integers k >= 3 and 1 <= l <= k - 1, we prove that for any alpha > 0, there exist epsilon > 0 and C > 0 such that for sufficiently large n is an element of (k - l)N, the union of a k-uniform hypergraph with minimum vertex degree alpha n(k-1) and a binomial random k-uniform hypergraph G((k)) (n, p) with p >= n(-(k-l)-epsilon) for l >= 2 and p >= Cn(-(k-1)) for l = 1 on the same vertex set contains a Hamiltonian l-cycle with high probability. Our result is best possible up to the values of epsilon and C and answers a question of Krivelevich, Kwan and Sudakov. (C) 2020 Elsevier Inc. All rights reserved. (AU) | |
| Processo FAPESP: | 14/18641-5 - Circuitos hamiltonianos e problemas de ladrilhamento em hipergrafos |
| Beneficiário: | Jie Han |
| Modalidade de apoio: | Bolsas no Brasil - Pós-Doutorado |