The longest induced path in a sparse random graph

2021-12-14 09:30 - 10:30

Abstract: A long-standing problem in random graph theory has been to determine asymptotically the length of a longest induced path in sparse random graphs. Independent work of Luczak and Suen from the 90s showed the existence of an induced path of roughly half the optimal size, which seems to be a barrier for certain natural approaches. Recently, in joint work with Draganic and Krivelevich, we solved this problem. In the talk, I will discuss the history of the problem and give an overview of the proof.