arXiv Analytics

Sign in

arXiv:2305.17360 [math.CO]AbstractReferencesReviewsResources

On powers of Hamilton cycles in Ramsey-Turán Theory

Ming Chen, Jie Han, Yantao Tang, Donglei Yang

Published 2023-05-27Version 1

We prove that for $r\in \mathbb{N}$ with $r\geq 2$ and $\mu>0$, there exist $\alpha>0$ and $n_{0}$ such that for every $n\geq n_{0}$, every $n$-vertex graph $G$ with $\delta(G)\geq \left(1-\frac{1}{r}+\mu\right)n$ and $\alpha(G)\leq \alpha n$ contains an $r$-th power of a Hamilton cycle. We also show that the minimum degree condition is asymptotically sharp for $r=2, 3$ and the $r=2$ case was recently conjectured by Staden and Treglown.

Comments: 19 pages, 4 figures
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1811.07482 [math.CO] (Published 2018-11-19, updated 2019-06-10)
Minimum degree condition for a graph to be knitted
arXiv:2412.18336 [math.CO] (Published 2024-12-24)
Powers of Hamilton cycles in oriented and directed graphs
arXiv:2103.10414 [math.CO] (Published 2021-03-18)
Tight bound for powers of Hamilton cycles in tournaments