Proof of the Seymour conjecture for large graphs
- Cite this article as:
- Komlós, J., Sárközy, G.N. & Szemerédi, E. Annals of Combinatorics (1998) 2: 43. doi:10.1007/BF01626028
- 209 Downloads
Paul Seymour conjectured that any graphG of ordern and minimum degree of at leastk/k+1n contains thekth power of a Hamiltonian cycle. Here, we prove this conjecture for sufficiently largen.
AMS Subject Classification05C45
Keywordsdense graphs powers of Hamiltonian cycles
© Springer-Verlag 1998