On degree sequences forcing the square of a Hamilton cycle
A famous conjecture of Posa from 1962 asserts that every graph on n vertices and with minimum degree at least 2n/3 contains the square of a Hamilton cycle. The conjecture was proven for large graphs in 1996 by Komlos, Sarkozy, and Szemeredi [Random Structures Algorithms, 9 (1996) pp. 193-211]. In th...
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Journal article |
| Baskı/Yayın Bilgisi: |
Society for Industrial and Applied Mathematics
2017
|