| Author(s): |
Bastos, Josefran de Oliveira
[1]
;
Mota, Guilherme Oliveira
[2]
;
Schacht, Mathias
[3]
;
Schnitzer, Jakob
[3]
;
Schulenburg, Fabian
[3]
Total Authors: 5
|
| Affiliation: | [1] Univ Fed Ceara, Engn Comp, Fortaleza, Ceara - Brazil
[2] Univ Fed ABC, Ctr Matemat Comp & Cognicao, Santo Andre, SP - Brazil
[3] Univ Hamburg, Fachbereich Math, Hamburg - Germany
Total Affiliations: 3
|
| Document type: | Journal article |
| Source: | CONTRIBUTIONS TO DISCRETE MATHEMATICS; v. 13, n. 2, p. 88-100, 2018. |
| Web of Science Citations: | 0 |
| Abstract | |
We prove for all k >= 4 and 1 <= l < k/2 the sharp minimum (k - 2)-degree bound for a k-uniform hypergraph H on n vertices to contain a Hamiltonian l-cycle k - l divides n and n is sufficiently large. This extends a result of Han and Zhao for 3-uniform hypegraphs. (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: | 18/04876-1 - Ramsey theory, structural graph theory and applications in Bioinformatics |
| Grantee: | Guilherme Oliveira Mota |
| Support Opportunities: | Research Grants - Young Investigators Grants |
| FAPESP's process: | 13/20733-2 - Extremal and probabilistic combinatorics |
| Grantee: | Guilherme Oliveira Mota |
| Support Opportunities: | Scholarships abroad - Research Internship - Post-doctor |