arXiv (All)
open access
Baire Measurable Matchings in Non-Amenable Graphs
We prove that every Schreier graph of a free Borel action of a finitely generated non-amenable group admits a Baire measurable perfect matching, and that the Schreier graph of a free computable action of a finitely generated non-amenable group admits a computable perfect matching. These results were
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
- Comparison and Almost Finiteness for Actions of Amenable Groups#1049438
- Free groups amenably act on unital simple AF-algebras#1156732
- Unfriendly partitions of locally finite Borel graphs#999595
- The Borel Distinguishing Number of Schreier Graphs#1084902
- A nearcircumsphere-Ramsey Theorem for Solvable Transitive Configurations#926165
Record · ID 986078
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