- This event has passed.
Jaehoon Kim (김재훈), A resilience version of Pósa’s theorem
June 23 Tuesday @ 4:30 PM - 5:30 PM KST
Pósa’s theorem states that any graph G whose degree sequence $d_1\leq \dots \leq d_n$ satisfies $d_i \geq i+1$ for all $i< n/2$ has a Hamilton cycle. This degree condition is best possible. We show that a similar result holds for suitable subgraphs $G$ of random graphs. This is joint work with Padraig Condon, Alberto Espuny Diaz, Daniela Kühn and Deryk Osthus.