Long induced cycles in pseudorandom graphs

We show that, for some absolute constants $c_1,c_2>0$, every $(n,d,λ)$-graph with $λ\le c_1 d$ contains an induced cycle of length at least $c_2n\log(d/λ)/d$. This is best possible up to the values of $c_1,c_2$. Our techniques include a multi-scale algorithmic analysis, an adapted depth-first explor