Advanced search
Start date
Betweenand
Related content
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

LOOSE HAMILTONIAN CYCLES FORCED BY LARGE (k-2)-DEGREE-APPROXIMATE VERSION

Full text
Author(s):
Bastos, Josefran de Oliveira [1] ; Mota, Guilherme Oliveira [1] ; Schacht, Mathias [2] ; Schnitzer, Jakob [2] ; Schulenburg, Fabian [2]
Total Authors: 5
Affiliation:
[1] Univ Sao Paulo, Inst Matemat & Estat, Sao Paulo - Brazil
[2] Univ Hamburg, Fachbereich Math, Hamburg - Germany
Total Affiliations: 2
Document type: Journal article
Source: SIAM JOURNAL ON DISCRETE MATHEMATICS; v. 31, n. 4, p. 2328-2347, 2017.
Web of Science Citations: 3
Abstract

We prove that for all k >= 4 and 1 <= l < k/2, every k-uniform hypergraph H on n vertices with delta(k-2)(H) >= (4(k-l)-1/4(k-l)(2) + o(1)) ((n)(2)) contains a Hamiltonian l-cycle if k-l divides n. This degree condition is asymptotically best possible. The case k = 3 was addressed earlier by Buss et al. (AU)

FAPESP's process: 13/11431-2 - Extremal and probabilistic combinatorics
Grantee:Guilherme Oliveira Mota
Support Opportunities: Scholarships in Brazil - Post-Doctoral
FAPESP's process: 13/20733-2 - Extremal and probabilistic combinatorics
Grantee:Guilherme Oliveira Mota
Support Opportunities: Scholarships abroad - Research Internship - Post-doctor