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

Abstract: We prove that for

r i n m a t h b b N

with

r g e q 2

and

m u > 0

, there exist

a l p h a > 0

and

n_{0}

such that for every

n g e q n_{0}

, every

n

-vertex graph

G

with

d e l t a (G) g e q l e f t (1 - f r a c 1 r + m u i g h t) n

and

a l p h a (G) l e q a l p h a 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.

This page was built for publication: On powers of Hamilton cycles in Ramsey-Tur\'{a}n Theory