On the Pósa-Seymour conjecture

@article{Komls1998OnTP,
  title={On the P{\'o}sa-Seymour conjecture},
  author={J{\'a}nos Koml{\'o}s and G{\'a}bor N. S{\'a}rk{\"o}zy and Endre Szemer{\'e}di},
  journal={Journal of Graph Theory},
  year={1998},
  volume={29},
  pages={167-176}
}
Paul Seymour conjectured that any graph G of order n and minimum degree at least k k+1n contains the k th 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. c… CONTINUE READING