Packing and finding paths in sparse random graphs

Vesna Iršič, Julien Portier, Leo Versteegen

Let $G\sim G(n,p)$ be a (hidden) Erdős-Rényi random graph with $p=(1+\epsilon )/n$ for some fixed constant $\epsilon >0$. Ferber, Krivelevich, Sudakov, and Vieira showed tha…