arXiv (All)
open access
Unfriendly partitions of locally finite Borel graphs
We answer in the negative the question of Thomas, recorded by Conley, Conley--Marks--Unger, and Conley--Tamuz, of whether every locally finite Borel graph admits a Borel unfriendly partition. Our counterexample has unbounded degree and is closed on a zero-dimensional Polish space; its connectedness
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
- Boundedness and Separation Between Induced and Non-Induced Covering Numbers#996688
- An Induced $A$-Path Theorem#820307
- Settling the total domination-annihilation conjecture for graphs with minimum degree two#1069947
- Almost-linear Zarankiewicz bounds in $1$-semi-equational theories#973348
Record · ID 999595
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