We also discuss some open problems: • Is there a Borel version of the Lovász Local Lemma for graphs generated by actions of amenable groups?
Statement
We also discuss some open problems: • Is there a Borel version of the Lovász Local Lemma for graphs generated by actions of amenable groups? • The Borel Ruziewicz problem: is Lebesgue measure the only finitely ad- ditive measure defined on the Borel subsets of the n-sphere for n \geq 2? • Does every bounded degree Borel graph have an unfriendly Borel coloring? • Does every Borel graph generated by n functions have Borel chromatic number at most (2n + 1) if it has a finite Borel coloring? • If G is a Borel graph of degree at most d, does G have a Baire measurable (d + 1)-edge coloring? • Let a be the Bernoulli shift of F2 with its usual generating set and µ the usual product measure. What is the measurable independence number and measurable chromatic number of this graph? Problem Session Jan Grebı́k We collect several interesting problems connected with the main theme of this workshop. As a motivation, we first discuss a folklore result that has been known in the context of descriptive combinatorics, distributed computing and random processes. Namely, any local problem on oriented path is either trivial, solvable by standard methods in each field, or global. Moreover, given a local problem, it is decidable
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.