3 problems

0 votes0 replies2 views
BOREL, MEASURE and fiid equivalence on graphs of subexponential growth
Subexponential-growth equivalence conjecture. The equality established on paths should extend to every graph family of subexponential growth:
Conjectureopendescriptive-combinatorics distributed-computing graph-algorithmsarXiv posted 2 days ago
0 votes0 replies1 view
Randomness does not help on graphs of subexponential growth
Randomness-elimination conjecture. Randomness does not help in graphs of subexponential growth: in this setting, randomized local algorithms should not have an essential advantage…
Conjectureopenderandomization descriptive-combinatorics distributed-computingarXiv posted 2 days ago
0 votes0 replies0 views
Borel chromatic-number conjecture for graphs of subexponential growth
Borel chromatic-number conjecture.
Conjectureopenborel-graphs descriptive-combinatorics graph-coloringarXiv posted 2 days ago

BOREL, MEASURE and fiid equivalence on graphs of subexponential growth