Graphings, Treeings, and CBERs (countable Borel equivalence relations) (problem 1)
Statement
Let be treeable. \begin{enumerate}[a. ] \item Does every Borel graphing, say, of contain a Borel subgraph, say , which is a treeing of ? \item What if we just want to be -measurable? \end{enumerate}
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.