Borel chromatic-number conjecture for graphs of subexponential growth
Borel chromatic-number conjecture for graphs of subexponential growth
Let be a Borel graph of subexponential growth. Write for its asymptotic separation index and for its Borel chromatic number.
Borel chromatic-number conjecture.
This conjecture would sharpen the general bound and, when , give the proposed bound . Its status is not resolved in the supplied material.
Sources & referencesView supporting material
Primary source
Anton Bernshteyn, “Distributed Algorithms, the Lovász Local Lemma, and Descriptive Combinatorics”, arXiv:2004.04905 (2023).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.