Journal of Combinatorial Theory, Series BVolume 50, Issue 2, December 1990, Pages 309-318Powers of Hamilton cycles in tournamentsAuthor links open overlay panelBéla Bollobás a b ∗, Roland HäggkvistShow moreShareCitehttps://doi.org/10.1016/0095-8956(90)90085-EGet rights and contentUnder an Elsevier user licenseopen archiveAbstractOur main aim is to show that for every ε > 0 and k ∈ N there is an n(ε, k) such that if T is a tournament of order n ≥n(ε, k) and in T every vertex has indegree at least (14+ε)n and at most (34−ε)n then T contains the kth power of a Hamilton cycle.Previous article in issueNext article in issueRecommended articlesCited by (0)∗Supported by NSF Grant 8104854.Copyright © 1990 Published by Elsevier Inc.