Abstract: In this series of talks, we will study different approaches to the Hamiltonicity problem in sparse pseudorandom graphs. In this first talk, we will review the celebrated “extension-rotation” technique pioneered by Pósa in the 70s and how to use it in pseudorandom graphs to find Hamilton cycles.
Comparte en: