9 problems

Universal mandatory and blocking edge conjecture. The marked random graphs

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…

Compactified unrooted convergence conjecture. The sequence $G_n$ converges weakly with respect to $d$.

Compactified rooted convergence conjecture. The sequence $R_n$ converges weakly with respect to $d$.

Rooted minor-exclusion convergence conjecture. The sequence $R_n$ converges weakly.

Let $X$ be the canonical process under the excursion measure $\mathbf{N}$ of the strong Markov process $X-I$ at zero. Write $H$ for the height process, $\zeta$ for its lifetime, an…

Let $X$ be the canonical process under the excursion measure $\mathbf{N}$ of the strong Markov process $X-I$ at zero. Write $H$ for the height process, $\zeta$ for its lifetime, an…

A graphing is a bounded-degree Borel graph satisfying the Intrinsic Mass Transport Principle. A bounded-degree graph sequence has a Benjamini–Schramm limit when the distribution of…

Local convergence conjecture. The pair