2 problems

Construct the locally finite connected rooted random graph $G^\bullet$ from the partially labeled rooted random tree $T^\bullet$ as described in the source: even-generation vertice…

Connectivity and Hamiltonicity conjecture. Under these assumptions, $\mathcal{G}(n,m,p)$ is $k$-connected for every fixed constant $k$ and contains a Hamilton cycle with high proba…