Minimum degree conditions for Hamilton \(l\)-cycles in \(k\)-uniform hypergraphs
The electronic journal of combinatorics, Tome 32 (2025) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We show that for $ \eta>0 $ and sufficiently large $ n $, every 5-graph on $ n $ vertices with $\delta_{2}(H)\ge (91/216+\eta)\binom{n}{3}$ contains a Hamilton 2-cycle. This minimum 2-degree condition is asymptotically best possible. Moreover, we give some related results on minimum $ d $-degree conditions in $ k $-graphs that guarantee the existence of a Hamilton $ \ell $-cycle when $\ell\le d \le k-1$ and $1\le \ell < k/2$.
DOI : 10.37236/12143
Classification : 05C45, 05C35, 05C07, 05C65
Mots-clés : Dirac thresholds of hypergraphs, \(F\)-tiling

Jie Han    ; Lin Sun  1   ; Guanghui Wang 

1 linsun77@163.com
@article{10_37236_12143,
     author = {Jie Han and Lin Sun and Guanghui Wang},
     title = {Minimum degree conditions for {Hamilton} \(l\)-cycles in \(k\)-uniform hypergraphs},
     journal = {The electronic journal of combinatorics},
     year = {2025},
     volume = {32},
     number = {1},
     doi = {10.37236/12143},
     zbl = {1566.05084},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/12143/}
}
TY  - JOUR
AU  - Jie Han
AU  - Lin Sun
AU  - Guanghui Wang
TI  - Minimum degree conditions for Hamilton \(l\)-cycles in \(k\)-uniform hypergraphs
JO  - The electronic journal of combinatorics
PY  - 2025
VL  - 32
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/12143/
DO  - 10.37236/12143
ID  - 10_37236_12143
ER  - 
%0 Journal Article
%A Jie Han
%A Lin Sun
%A Guanghui Wang
%T Minimum degree conditions for Hamilton \(l\)-cycles in \(k\)-uniform hypergraphs
%J The electronic journal of combinatorics
%D 2025
%V 32
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/12143/
%R 10.37236/12143
%F 10_37236_12143
Jie Han; Lin Sun; Guanghui Wang. Minimum degree conditions for Hamilton \(l\)-cycles in \(k\)-uniform hypergraphs. The electronic journal of combinatorics, Tome 32 (2025) no. 1. doi: 10.37236/12143

Cité par Sources :