The Maximum Block Size of Critical Random Graphs

Vonjy Rasendrahasina, Andry Rasoanaivo, Vlady Ravelomanana

Let $G(n,M)$ be the uniform random graph with $n$ vertices and $M$ edges. Let $B_n$ be the maximum block-size of $G(n,M)$ or the maximum size of its maximal $2$-connected ind…