The largest hole in sparse random graphs

Abstract

We show that for any d=d(n) with d0(ϵ)≤d=o(n) , with high probability, the size of a largest induced cycle in the random graph G(n,d/n) is (2±ϵ)ndlogd . This settles a long‐standing open problem in random graph theory.