3 problems

Borel Almost Finiteness Conjecture. Every uniformly Borel amenable Følner graph is Borel almost finite.

Borel chromatic-number conjecture.

Aperiodic Borel equitable Brooks conjecture. The graph $G$ has a $\mu$-equitable $\Delta$-coloring.