Proof of the Seymour Conjecture for Large Graphs

Paul Seymour conjectured that any graph G of order n and minimum degree of at least k-~T1 n contains the kth power of a Hamiltonian cycle. Here, we prove this conjecture for sufficiently large n.