5 problems

Compilation-equivalence characterization conjecture. If

Let $f(k)$ be the smallest integer $f$ such that for every $d\in[k]$ the following holds. Let $G$ be an arbitrary finite graph such that every degree is at most $d$, except at most…

Let a modeling be a measurable graph equipped with a probability measure for which first-order definable sets are measurable. A graph has bounded degree if its vertex degrees are u…

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-global convergence conjecture. A growing sequence of random $d$-regular graphs is local-global convergent with probability one.