Paul Seymour conjectured that any graph G of order n and minimum degree at least k/k+1 n contains the kth power of a Hamilton cycle. We prove the following approximate version. For any ∈ > 0 and positive integer k, there is an n0 such that, if G has order n ≥ n0 and minimum degree at least (k/k+1 + ∈)n, then G contains the kth power of a Hamilton cycle.
|Number of pages||10|
|Journal||Journal of Graph Theory|
|Publication status||Published - Nov 1998|
- Hamilton cycle
- Regularity lemma
ASJC Scopus subject areas
- Geometry and Topology