On powers of Hamilton cycles in Ramsey-Tur\'an Theory
Abstract
We prove that for r∈ N with r≥ 2 and μ>0, there exist α>0 and n0 such that for every n≥ n0, every n-vertex graph G with δ(G)≥ (1-1r+μ)n and α(G)≤ α 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.