Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs

Padraig Condon, Alberto Espuny Díaz, Jaehoon Kim +2

Pósa's theorem states that any graph $G$ whose degree sequence $d_1\le \dots \le d_n$ satisfies $d_i\ge i+1$ for all $i<n/2$ has a Hamilton cycle. This degree condition is bes…