Complexity of combinatorial questions and dichotomy theorems (problem 4)
Statement
Let be an acyclic analytic Borel graph with uncountable Borel chromatic number. Is there an injective continuous reduction from to ( iff )?
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.