On the strength of connectedness of unions of random graphs

Mindaugas Bloznelis

Let $G_1,\dots ,G_m$ be independent identically distributed random subgraphs of the complete graph ${\mathcal{K}}_n$. We analyse the threshold behaviour of the strength of connectedness…