English

Local Coloring Problems on Smooth Graphs

Logic 2021-05-12 v2 Combinatorics

Abstract

We construct a smooth locally finite Borel graph GG and a local coloring problem Π\Pi such that GG has a coloring V(G)NV(G) \to \mathbb{N} that solves Π\Pi, but no such coloring can be Borel.

Keywords

Cite

@article{arxiv.2012.11031,
  title  = {Local Coloring Problems on Smooth Graphs},
  author = {Anton Bernshteyn},
  journal= {arXiv preprint arXiv:2012.11031},
  year   = {2021}
}

Comments

5 pages, 1 figure

R2 v1 2026-06-23T21:06:46.349Z