English

On powers of Hamilton cycles in Ramsey-Tur\'{a}n Theory

Combinatorics 2023-05-30 v1

Abstract

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

Keywords

Cite

@article{arxiv.2305.17360,
  title  = {On powers of Hamilton cycles in Ramsey-Tur\'{a}n Theory},
  author = {Ming Chen and Jie Han and Yantao Tang and Donglei Yang},
  journal= {arXiv preprint arXiv:2305.17360},
  year   = {2023}
}

Comments

19 pages, 4 figures