arXiv (All)
open access
Failure of the $G_0$-dichotomy for generalized Cantor spaces
Kechris, Solecki and Todorčević's $G_0$-dichotomy characterizes Borel graphs that admit a Borel measurable coloring with countably many colors. We show that the analogue to the $G_0$-dichotomy for generalized Cantor spaces fails at the lowest possible complexity, namely for closed graphs.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Baire Measurable Matchings in Non-Amenable Graphs#986078
- Generating Functions and the Entropy Hierarchy of Strongly Connected Digraphs#1123701
- A Randomness Test Formalism for Neutral Measures and Beyond#1076398
- Typical properties of countable graphs: flows and bridges#1064560
- Revisiting Some Counting Problems in Discrete Mathematics.#487606
Record · ID 998418
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive