Borel (2n+1) -coloring for bounded degree function graphs
math.LO, math.CO
Submitted: 2026-11-15
Updated: 2026-11-15
Related papers
- The consistency strength of the failure of amenable C-sequences
- Classification of bipartite observables III: simplicity, mixtures and quantum error correction
- The Additive Arithmetic of Linear Orders
- Indiscernible Extraction in Theories with Bounded k-splitting
- Measuring the Complexity of Countable Presburger Models
- A non-trivially non-trivial automorphism at an inaccessible cardinal