Relationships between different definable settings (problem 2)
Statement
Let be a LCL such that every highly computable graph admits a computable -coloring. Does every locally finite Borel graph admit a Baire measurable -coloring?
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.