An improved lower bound on the length of the longest cycle in random graphs

Michael Anastos

We provide a new lower bound on the length of the longest cycle of the binomial random graph $G(n,(1+\epsilon )/n)$ that holds w.h.p. for all $\epsilon =\epsilon (n)$ such that ${\epsilon }^{3}n\to \infty$. In the ca…