Distance from marker sequences in locally finite Borel graphs
- Resource Type
- Working Paper
- Authors
- Conley, Clinton T.; Marks, Andrew S.
- Source
- Subject
- Mathematics - Logic
- Language
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.