Speaker: 

Jie Han

Institution: 

Beijing Institute of Technology

Time: 

Wednesday, February 1, 2023 - 2:00pm to 3:00pm

Host: 

Location: 

510R Rowland Hall

Dirac's theorem says that any n-vertex graph with minimum degree at least n/2 contains a Hamiltonian cycle. A robust version of Dirac's theorem was obtained by Krivelevich, Lee and Sudakov: for such graphs, if we take a random subgraph where every edge is included with probability Clog(n)/n, for some large fixed constant C, then whp the resulting graph is still Hamiltonian. We will discuss some recent results along this line.