Borel chromatic numbers of closed graphs and forcing with uniform trees
Logic
2022-08-16 v1 Combinatorics
Abstract
In this work, we continue the tradition initiated by Geschke, 2011 of viewing the uncountable Borel chromatic number of analytic graphs as cardinal invariants of the continuum. We show that various uncountable Borel chromatic numbers of closed graphs can be consistently different, as well as consistently equal to the continuum. This is done using arguments that are typical to Axiom A forcing notions.
Keywords
Cite
@article{arxiv.2208.06914,
title = {Borel chromatic numbers of closed graphs and forcing with uniform trees},
author = {Michel Gaspar and Stefan Geschke},
journal= {arXiv preprint arXiv:2208.06914},
year = {2022}
}