Borel chromatic numbers of closed graphs and forcing with uniform trees

arXiv2208.06914MaRDI QIDQ6407829FDOQ6407829

Authors: Michel Gaspar, Stefan Geschke 

Publication date: 14 August 2022

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.

This page was built for publication: Borel chromatic numbers of closed graphs and forcing with uniform trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6407829)