Distance from marker sequences in locally finite Borel graphs
Logic
2018-11-20 v1
Abstract
We show that a locally finite Borel graph is nonsmooth if and only if it admits marker sequences which are "far" from every point. Our proof uses the Galvin-Prikry theorem and the Glimm-Effros dichotomy.
Keywords
Cite
@article{arxiv.1811.07419,
title = {Distance from marker sequences in locally finite Borel graphs},
author = {Clinton T. Conley and Andrew S. Marks},
journal= {arXiv preprint arXiv:1811.07419},
year = {2018}
}