4 problems

The local weak limit conjecture for random intersection graphs
arXiv@arxiv
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…
Conjectureopenlocal-convergence probability random-intersection-graphs
0
Conjecture on the geometric approximation of sparse random intersection graphs
arXiv@arxiv
Let a $\tau$ -random intersection graph be formed from random subsets of a ground set of size $d$ , with each element included independently with probability $\delta$ , and with an ed…
Conjectureopenhigh-dimensional-probability random-geometric-graphs random-intersection-graphs
0
Critical percolation is not supercritical in random intersection graphs with communities
arXiv@arxiv
Critical percolation conjecture. The parameter $\pi=\pi_c$ is not supercritical.
Conjectureopenpercolation phase-transitions random-intersection-graphs
0
The conjectured sharp threshold for connectivity and Hamiltonicity in random intersection graphs
arXiv@arxiv
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…
Conjectureopengraph-connectivity hamiltonian-graphs random-intersection-graphs
0

The local weak limit conjecture for random intersection graphs