arXiv (All)
open access
The measure half of the $2n+1$ problem
Let $F_0,\dots,F_{n-1}$ be Borel functions on a standard Borel space $X$ and let $G_F$ be the graph they generate. We prove that for every Borel probability measure $μ$ on $X$ there are a forward-invariant $μ$-conull Borel set $A \subseteq X$ and a proper Borel $(2n+1)$-coloring of the restriction o
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
- Topology Attack and Defense for Graph Neural Networks: An Optimization Perspective#19724
- Contribution à l'étude de quelques problèmes de coloration de graphes#370924
- Whitney's 2-isomorphism theorem for graphings#1141541
- Sub-quorum colorings of some infinite families of caterpillars#1144586
- Ramsey-like theorems for the Schreier barrier#179100
Record · ID 1013249
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