1 problem

Let $\mathcal{G}(n,p)$ be the binomial random graph, and suppose that $p$ is above the threshold of connectivity. The hyperbolicity of a graph is the graph parameter measuring the…